/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_77-tricky_address4_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-a47a088281b0b97d17910950432b7c5b5bc3adeb-a47a088 [2021-07-13 19:09:42,891 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-13 19:09:42,893 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-13 19:09:42,933 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-13 19:09:42,934 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-13 19:09:42,937 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-13 19:09:42,941 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-13 19:09:42,946 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-13 19:09:42,948 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-13 19:09:42,952 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-13 19:09:42,953 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-13 19:09:42,954 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-13 19:09:42,955 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-13 19:09:42,957 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-13 19:09:42,958 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-13 19:09:42,959 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-13 19:09:42,961 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-13 19:09:42,962 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-13 19:09:42,964 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-13 19:09:42,969 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-13 19:09:42,971 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-13 19:09:42,972 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-13 19:09:42,973 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-13 19:09:42,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-13 19:09:42,981 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-13 19:09:42,981 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-13 19:09:42,981 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-13 19:09:42,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-13 19:09:42,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-13 19:09:42,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-13 19:09:42,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-13 19:09:42,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-13 19:09:42,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-13 19:09:42,987 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-13 19:09:42,988 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-13 19:09:42,988 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-13 19:09:42,988 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-13 19:09:42,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-13 19:09:42,989 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-13 19:09:43,000 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-13 19:09:43,001 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-13 19:09:43,004 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-07-13 19:09:43,041 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-13 19:09:43,041 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-13 19:09:43,041 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-07-13 19:09:43,042 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-07-13 19:09:43,044 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-13 19:09:43,044 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-13 19:09:43,044 INFO L138 SettingsManager]: * Use SBE=true [2021-07-13 19:09:43,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-13 19:09:43,045 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-13 19:09:43,045 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-13 19:09:43,046 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-13 19:09:43,046 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-13 19:09:43,046 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-13 19:09:43,046 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-13 19:09:43,047 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-13 19:09:43,047 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-13 19:09:43,047 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-13 19:09:43,047 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-13 19:09:43,047 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-13 19:09:43,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-13 19:09:43,048 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-13 19:09:43,048 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-07-13 19:09:43,048 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-13 19:09:43,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-13 19:09:43,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-13 19:09:43,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-13 19:09:43,049 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-13 19:09:43,049 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-13 19:09:43,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-13 19:09:43,049 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-07-13 19:09:43,049 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-13 19:09:43,049 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-07-13 19:09:43,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-13 19:09:43,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-13 19:09:43,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-13 19:09:43,364 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-13 19:09:43,364 INFO L275 PluginConnector]: CDTParser initialized [2021-07-13 19:09:43,365 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_77-tricky_address4_racing.i [2021-07-13 19:09:43,451 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71678f9ae/12ec4a67b72d431b8f8dc0943f9cb252/FLAG99518facd [2021-07-13 19:09:44,005 INFO L306 CDTParser]: Found 1 translation units. [2021-07-13 19:09:44,005 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_77-tricky_address4_racing.i [2021-07-13 19:09:44,025 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71678f9ae/12ec4a67b72d431b8f8dc0943f9cb252/FLAG99518facd [2021-07-13 19:09:44,451 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71678f9ae/12ec4a67b72d431b8f8dc0943f9cb252 [2021-07-13 19:09:44,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-13 19:09:44,455 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-07-13 19:09:44,461 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-13 19:09:44,461 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-13 19:09:44,464 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-13 19:09:44,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 07:09:44" (1/1) ... [2021-07-13 19:09:44,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d3d5b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:09:44, skipping insertion in model container [2021-07-13 19:09:44,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 07:09:44" (1/1) ... [2021-07-13 19:09:44,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-13 19:09:44,511 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-13 19:09:44,869 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_77-tricky_address4_racing.i[41060,41073] [2021-07-13 19:09:44,890 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-13 19:09:44,902 INFO L203 MainTranslator]: Completed pre-run [2021-07-13 19:09:44,926 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_77-tricky_address4_racing.i[41060,41073] [2021-07-13 19:09:44,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-13 19:09:44,982 INFO L208 MainTranslator]: Completed translation [2021-07-13 19:09:44,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:09:44 WrapperNode [2021-07-13 19:09:44,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-13 19:09:44,984 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-13 19:09:44,984 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-13 19:09:44,984 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-13 19:09:44,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:09:44" (1/1) ... [2021-07-13 19:09:45,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:09:44" (1/1) ... [2021-07-13 19:09:45,027 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-13 19:09:45,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-13 19:09:45,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-13 19:09:45,028 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-13 19:09:45,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:09:44" (1/1) ... [2021-07-13 19:09:45,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:09:44" (1/1) ... [2021-07-13 19:09:45,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:09:44" (1/1) ... [2021-07-13 19:09:45,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:09:44" (1/1) ... [2021-07-13 19:09:45,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:09:44" (1/1) ... [2021-07-13 19:09:45,051 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:09:44" (1/1) ... [2021-07-13 19:09:45,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:09:44" (1/1) ... [2021-07-13 19:09:45,055 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-13 19:09:45,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-13 19:09:45,056 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-13 19:09:45,056 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-13 19:09:45,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:09:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-13 19:09:45,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-13 19:09:45,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-13 19:09:45,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-07-13 19:09:45,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-13 19:09:45,122 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-07-13 19:09:45,124 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-07-13 19:09:45,124 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-07-13 19:09:45,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-13 19:09:45,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-13 19:09:45,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-13 19:09:45,126 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-07-13 19:09:45,615 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-13 19:09:45,615 INFO L299 CfgBuilder]: Removed 35 assume(true) statements. [2021-07-13 19:09:45,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 07:09:45 BoogieIcfgContainer [2021-07-13 19:09:45,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-13 19:09:45,618 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-13 19:09:45,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-13 19:09:45,621 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-13 19:09:45,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 07:09:44" (1/3) ... [2021-07-13 19:09:45,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d2e9f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 07:09:45, skipping insertion in model container [2021-07-13 19:09:45,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:09:44" (2/3) ... [2021-07-13 19:09:45,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d2e9f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 07:09:45, skipping insertion in model container [2021-07-13 19:09:45,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 07:09:45" (3/3) ... [2021-07-13 19:09:45,623 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_77-tricky_address4_racing.i [2021-07-13 19:09:45,628 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-13 19:09:45,628 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-13 19:09:45,629 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-07-13 19:09:45,629 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-13 19:09:45,658 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,658 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,660 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,660 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,661 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,661 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,661 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,661 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,662 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,662 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,662 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,662 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,662 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,662 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,662 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,662 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,662 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,662 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,663 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,663 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,663 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,663 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,663 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,663 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,663 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,663 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,663 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,664 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,664 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,664 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,664 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,664 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,664 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,664 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,664 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,665 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,665 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,665 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,665 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,666 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,666 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,666 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,668 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,668 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,668 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,668 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,668 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,669 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,669 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,669 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,669 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,669 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,669 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,669 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,670 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,670 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,670 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,670 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,670 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,670 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,671 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,671 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,671 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,671 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,671 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,671 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,671 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,672 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,672 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,672 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,672 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,672 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,672 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,672 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,673 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,673 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,673 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,673 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,674 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,674 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,674 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,674 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,674 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,674 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,675 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,675 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,675 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,675 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,675 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,675 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,676 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,676 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,676 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,676 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,676 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,676 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,677 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,677 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,677 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,677 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,677 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,677 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,677 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,678 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,678 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,678 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,678 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,678 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,678 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,679 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,679 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,679 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,679 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,679 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,679 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,679 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,680 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,680 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,680 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,680 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,680 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,680 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,680 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,681 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,681 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,681 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,681 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,681 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,681 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,681 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,682 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,682 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,682 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,682 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,682 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,682 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,685 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,685 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,685 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,685 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,685 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,685 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,686 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,686 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,686 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,686 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,686 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,686 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,687 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,687 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,687 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,687 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,687 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,687 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,687 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,688 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,688 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,688 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,688 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:45,700 INFO L149 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2021-07-13 19:09:45,719 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-13 19:09:45,736 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-13 19:09:45,736 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-13 19:09:45,736 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-13 19:09:45,737 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-13 19:09:45,737 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-13 19:09:45,737 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-13 19:09:45,737 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-13 19:09:45,737 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == t_funThread1of1ForFork0======== [2021-07-13 19:09:45,749 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 158 places, 186 transitions, 380 flow [2021-07-13 19:09:45,849 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2220 states, 2215 states have (on average 2.2600451467268625) internal successors, (5006), 2219 states have internal predecessors, (5006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:45,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 2220 states, 2215 states have (on average 2.2600451467268625) internal successors, (5006), 2219 states have internal predecessors, (5006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:45,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-07-13 19:09:45,880 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:09:45,881 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:09:45,882 INFO L430 AbstractCegarLoop]: === Iteration 1 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:09:45,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:09:45,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1309434599, now seen corresponding path program 1 times [2021-07-13 19:09:45,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:09:45,898 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805659494] [2021-07-13 19:09:45,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:09:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:46,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 19:09:46,110 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:09:46,110 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805659494] [2021-07-13 19:09:46,111 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805659494] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 19:09:46,111 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 19:09:46,111 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-13 19:09:46,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237117151] [2021-07-13 19:09:46,115 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-07-13 19:09:46,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:09:46,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-07-13 19:09:46,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-13 19:09:46,137 INFO L87 Difference]: Start difference. First operand has 2220 states, 2215 states have (on average 2.2600451467268625) internal successors, (5006), 2219 states have internal predecessors, (5006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:46,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:09:46,182 INFO L93 Difference]: Finished difference Result 2128 states and 4142 transitions. [2021-07-13 19:09:46,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-13 19:09:46,183 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-07-13 19:09:46,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:09:46,207 INFO L225 Difference]: With dead ends: 2128 [2021-07-13 19:09:46,208 INFO L226 Difference]: Without dead ends: 1623 [2021-07-13 19:09:46,209 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-13 19:09:46,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2021-07-13 19:09:46,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1623. [2021-07-13 19:09:46,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1623 states, 1619 states have (on average 1.945027794935145) internal successors, (3149), 1622 states have internal predecessors, (3149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:46,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 3149 transitions. [2021-07-13 19:09:46,366 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 3149 transitions. Word has length 58 [2021-07-13 19:09:46,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:09:46,367 INFO L482 AbstractCegarLoop]: Abstraction has 1623 states and 3149 transitions. [2021-07-13 19:09:46,367 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:46,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 3149 transitions. [2021-07-13 19:09:46,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-07-13 19:09:46,372 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:09:46,372 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:09:46,373 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-13 19:09:46,373 INFO L430 AbstractCegarLoop]: === Iteration 2 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:09:46,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:09:46,378 INFO L82 PathProgramCache]: Analyzing trace with hash 152145400, now seen corresponding path program 1 times [2021-07-13 19:09:46,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:09:46,378 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924479473] [2021-07-13 19:09:46,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:09:46,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:46,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 19:09:46,503 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:09:46,503 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924479473] [2021-07-13 19:09:46,503 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924479473] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 19:09:46,503 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 19:09:46,504 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-13 19:09:46,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848764407] [2021-07-13 19:09:46,505 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-13 19:09:46,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:09:46,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-13 19:09:46,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-13 19:09:46,506 INFO L87 Difference]: Start difference. First operand 1623 states and 3149 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:46,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:09:46,532 INFO L93 Difference]: Finished difference Result 1627 states and 3153 transitions. [2021-07-13 19:09:46,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-13 19:09:46,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-07-13 19:09:46,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:09:46,540 INFO L225 Difference]: With dead ends: 1627 [2021-07-13 19:09:46,540 INFO L226 Difference]: Without dead ends: 1627 [2021-07-13 19:09:46,541 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-13 19:09:46,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2021-07-13 19:09:46,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1624. [2021-07-13 19:09:46,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1620 states have (on average 1.9444444444444444) internal successors, (3150), 1623 states have internal predecessors, (3150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:46,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 3150 transitions. [2021-07-13 19:09:46,586 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 3150 transitions. Word has length 58 [2021-07-13 19:09:46,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:09:46,586 INFO L482 AbstractCegarLoop]: Abstraction has 1624 states and 3150 transitions. [2021-07-13 19:09:46,586 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:46,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 3150 transitions. [2021-07-13 19:09:46,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-07-13 19:09:46,588 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:09:46,588 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:09:46,588 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-13 19:09:46,589 INFO L430 AbstractCegarLoop]: === Iteration 3 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:09:46,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:09:46,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1408293890, now seen corresponding path program 1 times [2021-07-13 19:09:46,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:09:46,590 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132601761] [2021-07-13 19:09:46,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:09:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:46,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 19:09:46,647 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:09:46,647 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132601761] [2021-07-13 19:09:46,648 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132601761] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:46,648 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807419491] [2021-07-13 19:09:46,648 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 [2021-07-13 19:09:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:46,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2021-07-13 19:09:46,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:09:46,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 19:09:46,983 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807419491] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:46,983 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:09:46,983 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-07-13 19:09:46,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049563892] [2021-07-13 19:09:46,984 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-13 19:09:46,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:09:46,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-13 19:09:46,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-07-13 19:09:46,985 INFO L87 Difference]: Start difference. First operand 1624 states and 3150 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:47,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:09:47,030 INFO L93 Difference]: Finished difference Result 1632 states and 3158 transitions. [2021-07-13 19:09:47,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-13 19:09:47,031 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-07-13 19:09:47,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:09:47,038 INFO L225 Difference]: With dead ends: 1632 [2021-07-13 19:09:47,038 INFO L226 Difference]: Without dead ends: 1632 [2021-07-13 19:09:47,038 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 30.9ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-07-13 19:09:47,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2021-07-13 19:09:47,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1629. [2021-07-13 19:09:47,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1629 states, 1625 states have (on average 1.9415384615384614) internal successors, (3155), 1628 states have internal predecessors, (3155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:47,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 3155 transitions. [2021-07-13 19:09:47,157 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 3155 transitions. Word has length 63 [2021-07-13 19:09:47,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:09:47,157 INFO L482 AbstractCegarLoop]: Abstraction has 1629 states and 3155 transitions. [2021-07-13 19:09:47,157 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:47,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 3155 transitions. [2021-07-13 19:09:47,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-07-13 19:09:47,159 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:09:47,160 INFO L508 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:09:47,360 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-07-13 19:09:47,361 INFO L430 AbstractCegarLoop]: === Iteration 4 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:09:47,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:09:47,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1616667064, now seen corresponding path program 2 times [2021-07-13 19:09:47,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:09:47,361 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648369533] [2021-07-13 19:09:47,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:09:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:47,441 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 19:09:47,441 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:09:47,441 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648369533] [2021-07-13 19:09:47,442 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648369533] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:47,442 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534472103] [2021-07-13 19:09:47,442 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 [2021-07-13 19:09:47,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-07-13 19:09:47,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-13 19:09:47,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjunts are in the unsatisfiable core [2021-07-13 19:09:47,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:09:47,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-07-13 19:09:47,631 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:09:47,633 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:47,633 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:09:47,634 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-13 19:09:47,650 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-07-13 19:09:47,651 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:09:47,655 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:47,656 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:09:47,656 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-13 19:09:47,737 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-13 19:09:47,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-07-13 19:09:47,741 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:09:47,746 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:47,747 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:09:47,747 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-13 19:09:47,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-13 19:09:47,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-13 19:09:47,820 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:09:47,824 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:47,825 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:09:47,831 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:47,835 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:09:47,836 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-07-13 19:09:47,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 18 treesize of output 14 [2021-07-13 19:09:47,920 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:09:47,921 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:47,924 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-07-13 19:09:47,925 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:18, output treesize:10 [2021-07-13 19:09:47,992 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-07-13 19:09:47,993 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534472103] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 19:09:47,993 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-07-13 19:09:47,995 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2021-07-13 19:09:47,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229926041] [2021-07-13 19:09:47,997 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-13 19:09:47,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:09:47,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-13 19:09:47,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-07-13 19:09:47,999 INFO L87 Difference]: Start difference. First operand 1629 states and 3155 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:48,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:09:48,471 INFO L93 Difference]: Finished difference Result 1951 states and 3731 transitions. [2021-07-13 19:09:48,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-07-13 19:09:48,479 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-07-13 19:09:48,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:09:48,485 INFO L225 Difference]: With dead ends: 1951 [2021-07-13 19:09:48,486 INFO L226 Difference]: Without dead ends: 1059 [2021-07-13 19:09:48,486 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 306.1ms TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2021-07-13 19:09:48,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2021-07-13 19:09:48,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1059. [2021-07-13 19:09:48,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 1057 states have (on average 1.8987701040681173) internal successors, (2007), 1058 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:48,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 2007 transitions. [2021-07-13 19:09:48,516 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 2007 transitions. Word has length 68 [2021-07-13 19:09:48,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:09:48,516 INFO L482 AbstractCegarLoop]: Abstraction has 1059 states and 2007 transitions. [2021-07-13 19:09:48,516 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:48,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 2007 transitions. [2021-07-13 19:09:48,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-07-13 19:09:48,519 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:09:48,519 INFO L508 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:09:48,743 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:09:48,743 INFO L430 AbstractCegarLoop]: === Iteration 5 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:09:48,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:09:48,744 INFO L82 PathProgramCache]: Analyzing trace with hash -69431433, now seen corresponding path program 1 times [2021-07-13 19:09:48,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:09:48,744 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464164946] [2021-07-13 19:09:48,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:09:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:48,806 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-07-13 19:09:48,807 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:09:48,807 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464164946] [2021-07-13 19:09:48,807 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464164946] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:48,807 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87180962] [2021-07-13 19:09:48,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2021-07-13 19:09:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:48,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2021-07-13 19:09:48,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:09:49,051 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-07-13 19:09:49,052 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87180962] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:49,052 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:09:49,052 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2021-07-13 19:09:49,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557968597] [2021-07-13 19:09:49,053 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-13 19:09:49,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:09:49,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-13 19:09:49,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-07-13 19:09:49,053 INFO L87 Difference]: Start difference. First operand 1059 states and 2007 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:49,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:09:49,142 INFO L93 Difference]: Finished difference Result 171 states and 266 transitions. [2021-07-13 19:09:49,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-13 19:09:49,142 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-07-13 19:09:49,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:09:49,143 INFO L225 Difference]: With dead ends: 171 [2021-07-13 19:09:49,143 INFO L226 Difference]: Without dead ends: 0 [2021-07-13 19:09:49,143 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 81.0ms TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-07-13 19:09:49,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-13 19:09:49,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-13 19:09:49,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:49,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-13 19:09:49,144 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2021-07-13 19:09:49,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:09:49,144 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-13 19:09:49,144 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:49,144 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-13 19:09:49,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-13 19:09:49,364 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:09:49,365 INFO L301 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE (1/2) [2021-07-13 19:09:49,367 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-07-13 19:09:49,368 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-13 19:09:49,368 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-13 19:09:49,368 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-13 19:09:49,368 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-13 19:09:49,368 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-13 19:09:49,368 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-13 19:09:49,368 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-13 19:09:49,368 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-13 19:09:49,371 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 158 places, 186 transitions, 380 flow [2021-07-13 19:09:49,413 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2985 states, 2980 states have (on average 2.397986577181208) internal successors, (7146), 2984 states have internal predecessors, (7146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:49,421 INFO L276 IsEmpty]: Start isEmpty. Operand has 2985 states, 2980 states have (on average 2.397986577181208) internal successors, (7146), 2984 states have internal predecessors, (7146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:49,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-07-13 19:09:49,422 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:09:49,422 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:09:49,422 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:09:49,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:09:49,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1144879738, now seen corresponding path program 1 times [2021-07-13 19:09:49,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:09:49,423 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079335021] [2021-07-13 19:09:49,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:09:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:49,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 19:09:49,440 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:09:49,440 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079335021] [2021-07-13 19:09:49,440 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079335021] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 19:09:49,440 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 19:09:49,440 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-13 19:09:49,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548938067] [2021-07-13 19:09:49,440 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-07-13 19:09:49,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:09:49,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-07-13 19:09:49,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-13 19:09:49,449 INFO L87 Difference]: Start difference. First operand has 2985 states, 2980 states have (on average 2.397986577181208) internal successors, (7146), 2984 states have internal predecessors, (7146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:49,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:09:49,487 INFO L93 Difference]: Finished difference Result 2877 states and 5679 transitions. [2021-07-13 19:09:49,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-13 19:09:49,487 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-07-13 19:09:49,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:09:49,493 INFO L225 Difference]: With dead ends: 2877 [2021-07-13 19:09:49,493 INFO L226 Difference]: Without dead ends: 1451 [2021-07-13 19:09:49,493 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-13 19:09:49,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2021-07-13 19:09:49,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1451. [2021-07-13 19:09:49,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1451 states, 1444 states have (on average 1.9362880886426592) internal successors, (2796), 1450 states have internal predecessors, (2796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:49,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 2796 transitions. [2021-07-13 19:09:49,527 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 2796 transitions. Word has length 42 [2021-07-13 19:09:49,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:09:49,527 INFO L482 AbstractCegarLoop]: Abstraction has 1451 states and 2796 transitions. [2021-07-13 19:09:49,527 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:49,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2796 transitions. [2021-07-13 19:09:49,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-07-13 19:09:49,528 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:09:49,528 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:09:49,528 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-13 19:09:49,529 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:09:49,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:09:49,529 INFO L82 PathProgramCache]: Analyzing trace with hash 572314360, now seen corresponding path program 1 times [2021-07-13 19:09:49,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:09:49,529 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037970867] [2021-07-13 19:09:49,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:09:49,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:49,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 19:09:49,550 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:09:49,550 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037970867] [2021-07-13 19:09:49,550 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037970867] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 19:09:49,550 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 19:09:49,551 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-13 19:09:49,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747587668] [2021-07-13 19:09:49,551 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-13 19:09:49,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:09:49,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-13 19:09:49,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-13 19:09:49,552 INFO L87 Difference]: Start difference. First operand 1451 states and 2796 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:49,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:09:49,569 INFO L93 Difference]: Finished difference Result 1455 states and 2800 transitions. [2021-07-13 19:09:49,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-13 19:09:49,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-07-13 19:09:49,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:09:49,574 INFO L225 Difference]: With dead ends: 1455 [2021-07-13 19:09:49,575 INFO L226 Difference]: Without dead ends: 1455 [2021-07-13 19:09:49,575 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-13 19:09:49,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2021-07-13 19:09:49,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1452. [2021-07-13 19:09:49,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1452 states, 1445 states have (on average 1.9356401384083044) internal successors, (2797), 1451 states have internal predecessors, (2797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:49,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 2797 transitions. [2021-07-13 19:09:49,621 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 2797 transitions. Word has length 42 [2021-07-13 19:09:49,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:09:49,622 INFO L482 AbstractCegarLoop]: Abstraction has 1452 states and 2797 transitions. [2021-07-13 19:09:49,623 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:49,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 2797 transitions. [2021-07-13 19:09:49,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-07-13 19:09:49,623 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:09:49,623 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:09:49,623 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-13 19:09:49,624 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:09:49,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:09:49,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1507642114, now seen corresponding path program 1 times [2021-07-13 19:09:49,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:09:49,624 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145122278] [2021-07-13 19:09:49,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:09:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:49,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 19:09:49,673 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:09:49,674 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145122278] [2021-07-13 19:09:49,674 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145122278] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:49,674 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075884416] [2021-07-13 19:09:49,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:09:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:49,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2021-07-13 19:09:49,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:09:49,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-07-13 19:09:49,816 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075884416] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 19:09:49,816 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-07-13 19:09:49,816 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-07-13 19:09:49,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962292130] [2021-07-13 19:09:49,817 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-13 19:09:49,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:09:49,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-13 19:09:49,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-07-13 19:09:49,818 INFO L87 Difference]: Start difference. First operand 1452 states and 2797 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:49,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:09:49,837 INFO L93 Difference]: Finished difference Result 1438 states and 2783 transitions. [2021-07-13 19:09:49,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-13 19:09:49,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-07-13 19:09:49,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:09:49,843 INFO L225 Difference]: With dead ends: 1438 [2021-07-13 19:09:49,843 INFO L226 Difference]: Without dead ends: 1438 [2021-07-13 19:09:49,843 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 12.8ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-07-13 19:09:49,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2021-07-13 19:09:49,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1438. [2021-07-13 19:09:49,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1438 states, 1432 states have (on average 1.943435754189944) internal successors, (2783), 1437 states have internal predecessors, (2783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:49,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 2783 transitions. [2021-07-13 19:09:49,876 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 2783 transitions. Word has length 47 [2021-07-13 19:09:49,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:09:49,876 INFO L482 AbstractCegarLoop]: Abstraction has 1438 states and 2783 transitions. [2021-07-13 19:09:49,876 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:49,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 2783 transitions. [2021-07-13 19:09:49,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-07-13 19:09:49,877 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:09:49,877 INFO L508 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:09:50,101 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:09:50,102 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:09:50,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:09:50,102 INFO L82 PathProgramCache]: Analyzing trace with hash 985402851, now seen corresponding path program 1 times [2021-07-13 19:09:50,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:09:50,102 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911977058] [2021-07-13 19:09:50,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:09:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:50,133 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-13 19:09:50,133 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:09:50,133 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911977058] [2021-07-13 19:09:50,133 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911977058] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:50,133 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708348366] [2021-07-13 19:09:50,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:09:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:50,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjunts are in the unsatisfiable core [2021-07-13 19:09:50,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:09:50,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-13 19:09:50,294 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708348366] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:50,294 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:09:50,295 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-07-13 19:09:50,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319765846] [2021-07-13 19:09:50,295 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-13 19:09:50,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:09:50,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-13 19:09:50,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-07-13 19:09:50,296 INFO L87 Difference]: Start difference. First operand 1438 states and 2783 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:50,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:09:50,353 INFO L93 Difference]: Finished difference Result 1446 states and 2791 transitions. [2021-07-13 19:09:50,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-13 19:09:50,354 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-07-13 19:09:50,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:09:50,359 INFO L225 Difference]: With dead ends: 1446 [2021-07-13 19:09:50,360 INFO L226 Difference]: Without dead ends: 1446 [2021-07-13 19:09:50,360 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 44.0ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-07-13 19:09:50,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2021-07-13 19:09:50,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1443. [2021-07-13 19:09:50,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1443 states, 1437 states have (on average 1.9401530967292973) internal successors, (2788), 1442 states have internal predecessors, (2788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:50,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 2788 transitions. [2021-07-13 19:09:50,393 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 2788 transitions. Word has length 48 [2021-07-13 19:09:50,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:09:50,393 INFO L482 AbstractCegarLoop]: Abstraction has 1443 states and 2788 transitions. [2021-07-13 19:09:50,394 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:50,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 2788 transitions. [2021-07-13 19:09:50,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-07-13 19:09:50,394 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:09:50,394 INFO L508 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:09:50,608 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:09:50,609 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:09:50,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:09:50,609 INFO L82 PathProgramCache]: Analyzing trace with hash -2108271767, now seen corresponding path program 2 times [2021-07-13 19:09:50,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:09:50,610 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632596282] [2021-07-13 19:09:50,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:09:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:50,669 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-13 19:09:50,669 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:09:50,670 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632596282] [2021-07-13 19:09:50,670 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632596282] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:50,670 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083383744] [2021-07-13 19:09:50,670 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:09:50,756 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-07-13 19:09:50,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-13 19:09:50,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2021-07-13 19:09:50,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:09:50,851 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-13 19:09:50,852 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083383744] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:50,852 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:09:50,852 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-07-13 19:09:50,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432003868] [2021-07-13 19:09:50,854 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-13 19:09:50,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:09:50,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-13 19:09:50,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-07-13 19:09:50,855 INFO L87 Difference]: Start difference. First operand 1443 states and 2788 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:50,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:09:50,916 INFO L93 Difference]: Finished difference Result 1451 states and 2796 transitions. [2021-07-13 19:09:50,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-13 19:09:50,917 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-07-13 19:09:50,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:09:50,922 INFO L225 Difference]: With dead ends: 1451 [2021-07-13 19:09:50,922 INFO L226 Difference]: Without dead ends: 1451 [2021-07-13 19:09:50,923 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 53.1ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-07-13 19:09:50,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2021-07-13 19:09:50,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1448. [2021-07-13 19:09:50,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1448 states, 1442 states have (on average 1.9368932038834952) internal successors, (2793), 1447 states have internal predecessors, (2793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:50,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 2793 transitions. [2021-07-13 19:09:50,957 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 2793 transitions. Word has length 53 [2021-07-13 19:09:50,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:09:50,957 INFO L482 AbstractCegarLoop]: Abstraction has 1448 states and 2793 transitions. [2021-07-13 19:09:50,958 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:50,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 2793 transitions. [2021-07-13 19:09:50,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-07-13 19:09:50,959 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:09:50,959 INFO L508 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:09:51,177 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:09:51,177 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:09:51,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:09:51,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1912041053, now seen corresponding path program 3 times [2021-07-13 19:09:51,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:09:51,178 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57455211] [2021-07-13 19:09:51,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:09:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:51,241 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-13 19:09:51,241 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:09:51,241 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57455211] [2021-07-13 19:09:51,241 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57455211] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:51,241 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558883391] [2021-07-13 19:09:51,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:09:51,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-07-13 19:09:51,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-13 19:09:51,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 8 conjunts are in the unsatisfiable core [2021-07-13 19:09:51,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:09:51,466 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-13 19:09:51,466 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558883391] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:51,466 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:09:51,466 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-07-13 19:09:51,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059465568] [2021-07-13 19:09:51,467 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-13 19:09:51,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:09:51,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-13 19:09:51,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-07-13 19:09:51,467 INFO L87 Difference]: Start difference. First operand 1448 states and 2793 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:51,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:09:51,568 INFO L93 Difference]: Finished difference Result 1456 states and 2801 transitions. [2021-07-13 19:09:51,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-13 19:09:51,569 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-07-13 19:09:51,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:09:51,575 INFO L225 Difference]: With dead ends: 1456 [2021-07-13 19:09:51,575 INFO L226 Difference]: Without dead ends: 1456 [2021-07-13 19:09:51,575 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 89.7ms TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-07-13 19:09:51,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2021-07-13 19:09:51,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1453. [2021-07-13 19:09:51,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1447 states have (on average 1.9336558396682793) internal successors, (2798), 1452 states have internal predecessors, (2798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:51,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2798 transitions. [2021-07-13 19:09:51,609 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2798 transitions. Word has length 58 [2021-07-13 19:09:51,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:09:51,610 INFO L482 AbstractCegarLoop]: Abstraction has 1453 states and 2798 transitions. [2021-07-13 19:09:51,610 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:51,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2798 transitions. [2021-07-13 19:09:51,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-07-13 19:09:51,611 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:09:51,611 INFO L508 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:09:51,824 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:09:51,825 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:09:51,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:09:51,825 INFO L82 PathProgramCache]: Analyzing trace with hash 822486953, now seen corresponding path program 4 times [2021-07-13 19:09:51,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:09:51,825 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221200596] [2021-07-13 19:09:51,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:09:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:51,905 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-13 19:09:51,905 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:09:51,905 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221200596] [2021-07-13 19:09:51,905 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221200596] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:51,906 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723334127] [2021-07-13 19:09:51,906 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:09:51,984 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-07-13 19:09:51,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-13 19:09:51,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2021-07-13 19:09:51,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:09:52,096 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-13 19:09:52,097 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723334127] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:52,097 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:09:52,097 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-07-13 19:09:52,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797834788] [2021-07-13 19:09:52,098 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-13 19:09:52,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:09:52,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-13 19:09:52,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-07-13 19:09:52,099 INFO L87 Difference]: Start difference. First operand 1453 states and 2798 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:52,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:09:52,216 INFO L93 Difference]: Finished difference Result 1461 states and 2806 transitions. [2021-07-13 19:09:52,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-07-13 19:09:52,217 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-07-13 19:09:52,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:09:52,222 INFO L225 Difference]: With dead ends: 1461 [2021-07-13 19:09:52,222 INFO L226 Difference]: Without dead ends: 1461 [2021-07-13 19:09:52,222 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 123.4ms TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2021-07-13 19:09:52,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2021-07-13 19:09:52,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1458. [2021-07-13 19:09:52,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1458 states, 1452 states have (on average 1.9304407713498624) internal successors, (2803), 1457 states have internal predecessors, (2803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:52,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 2803 transitions. [2021-07-13 19:09:52,260 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 2803 transitions. Word has length 63 [2021-07-13 19:09:52,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:09:52,260 INFO L482 AbstractCegarLoop]: Abstraction has 1458 states and 2803 transitions. [2021-07-13 19:09:52,260 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:52,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 2803 transitions. [2021-07-13 19:09:52,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-07-13 19:09:52,261 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:09:52,261 INFO L508 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:09:52,479 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-07-13 19:09:52,479 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:09:52,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:09:52,479 INFO L82 PathProgramCache]: Analyzing trace with hash -447519389, now seen corresponding path program 5 times [2021-07-13 19:09:52,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:09:52,480 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845798921] [2021-07-13 19:09:52,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:09:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:52,590 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-13 19:09:52,591 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:09:52,591 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845798921] [2021-07-13 19:09:52,591 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845798921] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:52,591 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135648116] [2021-07-13 19:09:52,591 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:09:52,703 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-07-13 19:09:52,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-13 19:09:52,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2021-07-13 19:09:52,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:09:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-13 19:09:52,829 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135648116] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:52,829 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:09:52,829 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2021-07-13 19:09:52,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678249938] [2021-07-13 19:09:52,829 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-07-13 19:09:52,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:09:52,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-07-13 19:09:52,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-07-13 19:09:52,830 INFO L87 Difference]: Start difference. First operand 1458 states and 2803 transitions. Second operand has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:52,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:09:52,978 INFO L93 Difference]: Finished difference Result 1466 states and 2811 transitions. [2021-07-13 19:09:52,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-07-13 19:09:52,978 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-07-13 19:09:52,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:09:52,984 INFO L225 Difference]: With dead ends: 1466 [2021-07-13 19:09:52,984 INFO L226 Difference]: Without dead ends: 1466 [2021-07-13 19:09:52,984 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 165.4ms TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2021-07-13 19:09:52,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2021-07-13 19:09:53,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1463. [2021-07-13 19:09:53,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1463 states, 1457 states have (on average 1.9272477693891559) internal successors, (2808), 1462 states have internal predecessors, (2808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:53,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1463 states and 2808 transitions. [2021-07-13 19:09:53,019 INFO L78 Accepts]: Start accepts. Automaton has 1463 states and 2808 transitions. Word has length 68 [2021-07-13 19:09:53,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:09:53,019 INFO L482 AbstractCegarLoop]: Abstraction has 1463 states and 2808 transitions. [2021-07-13 19:09:53,019 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:53,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 2808 transitions. [2021-07-13 19:09:53,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-07-13 19:09:53,020 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:09:53,020 INFO L508 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:09:53,245 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:09:53,245 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:09:53,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:09:53,245 INFO L82 PathProgramCache]: Analyzing trace with hash 774482921, now seen corresponding path program 6 times [2021-07-13 19:09:53,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:09:53,245 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693182381] [2021-07-13 19:09:53,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:09:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:53,383 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-13 19:09:53,383 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:09:53,383 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693182381] [2021-07-13 19:09:53,383 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693182381] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:53,384 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273528146] [2021-07-13 19:09:53,384 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:09:53,482 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-07-13 19:09:53,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-13 19:09:53,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 14 conjunts are in the unsatisfiable core [2021-07-13 19:09:53,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:09:53,623 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-13 19:09:53,623 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273528146] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:53,623 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:09:53,623 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2021-07-13 19:09:53,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461669794] [2021-07-13 19:09:53,624 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-07-13 19:09:53,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:09:53,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-07-13 19:09:53,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-07-13 19:09:53,625 INFO L87 Difference]: Start difference. First operand 1463 states and 2808 transitions. Second operand has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:53,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:09:53,820 INFO L93 Difference]: Finished difference Result 1471 states and 2816 transitions. [2021-07-13 19:09:53,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-07-13 19:09:53,820 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-07-13 19:09:53,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:09:53,825 INFO L225 Difference]: With dead ends: 1471 [2021-07-13 19:09:53,825 INFO L226 Difference]: Without dead ends: 1471 [2021-07-13 19:09:53,826 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 224.9ms TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812 [2021-07-13 19:09:53,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2021-07-13 19:09:53,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1468. [2021-07-13 19:09:53,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 1462 states have (on average 1.924076607387141) internal successors, (2813), 1467 states have internal predecessors, (2813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:53,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 2813 transitions. [2021-07-13 19:09:53,852 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 2813 transitions. Word has length 73 [2021-07-13 19:09:53,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:09:53,852 INFO L482 AbstractCegarLoop]: Abstraction has 1468 states and 2813 transitions. [2021-07-13 19:09:53,853 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:53,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 2813 transitions. [2021-07-13 19:09:53,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-07-13 19:09:53,853 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:09:53,853 INFO L508 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:09:54,068 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:09:54,069 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:09:54,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:09:54,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1392019747, now seen corresponding path program 7 times [2021-07-13 19:09:54,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:09:54,070 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510147462] [2021-07-13 19:09:54,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:09:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:54,213 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-13 19:09:54,214 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:09:54,214 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510147462] [2021-07-13 19:09:54,214 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510147462] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:54,214 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40514045] [2021-07-13 19:09:54,214 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:09:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:54,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 16 conjunts are in the unsatisfiable core [2021-07-13 19:09:54,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:09:54,434 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-13 19:09:54,435 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40514045] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:54,435 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:09:54,435 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2021-07-13 19:09:54,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560334431] [2021-07-13 19:09:54,435 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-07-13 19:09:54,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:09:54,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-07-13 19:09:54,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-07-13 19:09:54,436 INFO L87 Difference]: Start difference. First operand 1468 states and 2813 transitions. Second operand has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:54,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:09:54,653 INFO L93 Difference]: Finished difference Result 1476 states and 2821 transitions. [2021-07-13 19:09:54,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-07-13 19:09:54,661 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-07-13 19:09:54,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:09:54,677 INFO L225 Difference]: With dead ends: 1476 [2021-07-13 19:09:54,677 INFO L226 Difference]: Without dead ends: 1476 [2021-07-13 19:09:54,678 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 263.8ms TimeCoverageRelationStatistics Valid=340, Invalid=716, Unknown=0, NotChecked=0, Total=1056 [2021-07-13 19:09:54,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2021-07-13 19:09:54,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1473. [2021-07-13 19:09:54,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1473 states, 1467 states have (on average 1.9209270620313565) internal successors, (2818), 1472 states have internal predecessors, (2818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:54,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 2818 transitions. [2021-07-13 19:09:54,705 INFO L78 Accepts]: Start accepts. Automaton has 1473 states and 2818 transitions. Word has length 78 [2021-07-13 19:09:54,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:09:54,705 INFO L482 AbstractCegarLoop]: Abstraction has 1473 states and 2818 transitions. [2021-07-13 19:09:54,705 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:54,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 2818 transitions. [2021-07-13 19:09:54,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-07-13 19:09:54,706 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:09:54,706 INFO L508 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:09:54,920 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-07-13 19:09:54,921 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:09:54,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:09:54,921 INFO L82 PathProgramCache]: Analyzing trace with hash -2132484055, now seen corresponding path program 8 times [2021-07-13 19:09:54,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:09:54,921 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927564656] [2021-07-13 19:09:54,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:09:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:55,112 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-13 19:09:55,112 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:09:55,112 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927564656] [2021-07-13 19:09:55,112 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927564656] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:55,113 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194402053] [2021-07-13 19:09:55,113 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:09:55,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-07-13 19:09:55,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-13 19:09:55,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 18 conjunts are in the unsatisfiable core [2021-07-13 19:09:55,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:09:55,361 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-13 19:09:55,361 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194402053] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:55,361 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:09:55,361 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2021-07-13 19:09:55,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298069205] [2021-07-13 19:09:55,362 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-07-13 19:09:55,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:09:55,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-07-13 19:09:55,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2021-07-13 19:09:55,363 INFO L87 Difference]: Start difference. First operand 1473 states and 2818 transitions. Second operand has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:55,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:09:55,597 INFO L93 Difference]: Finished difference Result 1481 states and 2826 transitions. [2021-07-13 19:09:55,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-07-13 19:09:55,599 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-07-13 19:09:55,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:09:55,603 INFO L225 Difference]: With dead ends: 1481 [2021-07-13 19:09:55,603 INFO L226 Difference]: Without dead ends: 1481 [2021-07-13 19:09:55,604 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 332.6ms TimeCoverageRelationStatistics Valid=427, Invalid=905, Unknown=0, NotChecked=0, Total=1332 [2021-07-13 19:09:55,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2021-07-13 19:09:55,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1478. [2021-07-13 19:09:55,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1478 states, 1472 states have (on average 1.9177989130434783) internal successors, (2823), 1477 states have internal predecessors, (2823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:55,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 2823 transitions. [2021-07-13 19:09:55,634 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 2823 transitions. Word has length 83 [2021-07-13 19:09:55,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:09:55,634 INFO L482 AbstractCegarLoop]: Abstraction has 1478 states and 2823 transitions. [2021-07-13 19:09:55,634 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:55,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 2823 transitions. [2021-07-13 19:09:55,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-07-13 19:09:55,635 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:09:55,635 INFO L508 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:09:55,852 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-07-13 19:09:55,853 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:09:55,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:09:55,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1504445213, now seen corresponding path program 9 times [2021-07-13 19:09:55,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:09:55,853 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307795841] [2021-07-13 19:09:55,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:09:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:56,067 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-13 19:09:56,067 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:09:56,067 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307795841] [2021-07-13 19:09:56,067 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307795841] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:56,068 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414983419] [2021-07-13 19:09:56,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:09:56,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2021-07-13 19:09:56,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-13 19:09:56,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 20 conjunts are in the unsatisfiable core [2021-07-13 19:09:56,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:09:56,402 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-13 19:09:56,403 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414983419] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:56,403 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:09:56,403 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2021-07-13 19:09:56,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134653189] [2021-07-13 19:09:56,403 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-07-13 19:09:56,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:09:56,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-07-13 19:09:56,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2021-07-13 19:09:56,404 INFO L87 Difference]: Start difference. First operand 1478 states and 2823 transitions. Second operand has 23 states, 23 states have (on average 3.869565217391304) internal successors, (89), 23 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:56,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:09:56,665 INFO L93 Difference]: Finished difference Result 1483 states and 2828 transitions. [2021-07-13 19:09:56,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-07-13 19:09:56,666 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.869565217391304) internal successors, (89), 23 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-07-13 19:09:56,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:09:56,669 INFO L225 Difference]: With dead ends: 1483 [2021-07-13 19:09:56,669 INFO L226 Difference]: Without dead ends: 1483 [2021-07-13 19:09:56,670 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 378.7ms TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2021-07-13 19:09:56,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2021-07-13 19:09:56,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1483. [2021-07-13 19:09:56,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1483 states, 1477 states have (on average 1.914691943127962) internal successors, (2828), 1482 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:56,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 2828 transitions. [2021-07-13 19:09:56,696 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 2828 transitions. Word has length 88 [2021-07-13 19:09:56,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:09:56,696 INFO L482 AbstractCegarLoop]: Abstraction has 1483 states and 2828 transitions. [2021-07-13 19:09:56,696 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.869565217391304) internal successors, (89), 23 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:09:56,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 2828 transitions. [2021-07-13 19:09:56,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-07-13 19:09:56,697 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:09:56,697 INFO L508 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:09:56,912 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-07-13 19:09:56,913 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:09:56,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:09:56,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1822702487, now seen corresponding path program 10 times [2021-07-13 19:09:56,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:09:56,913 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609597039] [2021-07-13 19:09:56,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:09:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-13 19:09:56,932 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-13 19:09:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-13 19:09:56,947 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-13 19:09:56,967 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-13 19:09:56,967 INFO L609 BasicCegarLoop]: Counterexample might be feasible [2021-07-13 19:09:56,968 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-07-13 19:09:56,968 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2021-07-13 19:09:56,968 WARN L243 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2021-07-13 19:09:56,968 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2021-07-13 19:09:56,982 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,982 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,982 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,982 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,982 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,982 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,983 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,983 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,983 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,983 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,983 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,983 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,983 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,983 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,984 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,984 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,984 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,984 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,984 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,984 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,984 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,984 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,984 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,984 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,984 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,984 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,984 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,984 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,985 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,985 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,985 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,985 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,985 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,985 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,985 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,985 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,985 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,985 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,985 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,985 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,985 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,985 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,985 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,986 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,986 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,986 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,986 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,986 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,986 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,986 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,986 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,986 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,986 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,986 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,986 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,986 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,986 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,986 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,987 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,987 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,987 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,987 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,987 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,987 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,987 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,987 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,987 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,987 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,987 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,987 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,988 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,988 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,988 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,988 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,988 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,988 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,988 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,988 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,988 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,988 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,988 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,988 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,989 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,989 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,989 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,989 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,989 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,989 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,989 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,989 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,990 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,990 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,990 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,990 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,990 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,990 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,990 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,990 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,990 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,990 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,990 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,990 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,990 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,990 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,990 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,990 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,991 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,991 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,991 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,991 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,991 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,991 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,991 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,991 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,991 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,991 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,991 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,991 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,991 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,991 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,991 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,992 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,992 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,992 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,992 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,992 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,992 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,993 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,993 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,994 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,994 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,994 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,994 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,994 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,998 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,998 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,999 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,999 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,999 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,999 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,999 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,999 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,999 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,999 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,999 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,999 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,999 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:56,999 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,000 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,000 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,000 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,000 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,000 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,000 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,000 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,000 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,000 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,000 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,000 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,000 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,000 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,000 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,001 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,001 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,001 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,001 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,001 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,001 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,001 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,001 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,001 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,001 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,001 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,001 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,001 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,001 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,002 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,002 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,002 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,002 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,002 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,002 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,002 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,002 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,002 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,002 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,002 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,002 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,003 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,003 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,003 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,004 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,004 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,004 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,004 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,004 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,004 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,004 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,004 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,004 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,004 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,004 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,004 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,004 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,004 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,004 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,004 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,005 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,005 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,005 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,005 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,005 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,005 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,005 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,005 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,005 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,005 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,005 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,005 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,005 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,006 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,006 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,006 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,006 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,006 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,006 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,006 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,006 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,006 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,006 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,006 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,006 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,006 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,006 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,006 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,006 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,007 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,007 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,007 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,007 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,007 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,007 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,007 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,007 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,007 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,007 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,007 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,007 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,007 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,007 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,007 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,007 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,007 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,008 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,008 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,008 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,008 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,008 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,008 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,008 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,008 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,008 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,008 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,008 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,008 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,008 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,008 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,008 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,008 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,009 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,009 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,009 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,009 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,009 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,009 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,010 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,010 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,010 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,010 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,010 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,010 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,010 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,010 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,011 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,011 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,011 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,011 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,011 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,011 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,011 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,011 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,011 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,011 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,011 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,011 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,013 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,013 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,013 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,013 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,013 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,013 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,013 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,013 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,013 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,013 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,013 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,014 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,014 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,014 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,014 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,014 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,014 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,014 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,014 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,014 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,014 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,014 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,014 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:57,018 INFO L149 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-07-13 19:09:57,018 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-13 19:09:57,019 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-13 19:09:57,019 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-13 19:09:57,019 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-13 19:09:57,019 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-13 19:09:57,019 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-13 19:09:57,019 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-13 19:09:57,019 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-13 19:09:57,019 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == t_funThread1of2ForFork0======== [2021-07-13 19:09:57,026 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 217 places, 257 transitions, 532 flow [2021-07-13 19:10:01,687 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 193105 states, 193093 states have (on average 3.6028131522116285) internal successors, (695678), 193104 states have internal predecessors, (695678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:02,049 INFO L276 IsEmpty]: Start isEmpty. Operand has 193105 states, 193093 states have (on average 3.6028131522116285) internal successors, (695678), 193104 states have internal predecessors, (695678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:02,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-07-13 19:10:02,062 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:10:02,062 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:10:02,062 INFO L430 AbstractCegarLoop]: === Iteration 1 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:10:02,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:10:02,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1205536748, now seen corresponding path program 1 times [2021-07-13 19:10:02,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:10:02,063 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881048128] [2021-07-13 19:10:02,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:10:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:10:02,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 19:10:02,080 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:10:02,080 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881048128] [2021-07-13 19:10:02,080 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881048128] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 19:10:02,080 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 19:10:02,080 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-13 19:10:02,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876446755] [2021-07-13 19:10:02,081 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-07-13 19:10:02,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:10:02,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-07-13 19:10:02,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-13 19:10:02,921 INFO L87 Difference]: Start difference. First operand has 193105 states, 193093 states have (on average 3.6028131522116285) internal successors, (695678), 193104 states have internal predecessors, (695678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:05,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:10:05,415 INFO L93 Difference]: Finished difference Result 183278 states and 546271 transitions. [2021-07-13 19:10:05,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-13 19:10:05,415 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-07-13 19:10:05,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:10:05,898 INFO L225 Difference]: With dead ends: 183278 [2021-07-13 19:10:05,898 INFO L226 Difference]: Without dead ends: 90517 [2021-07-13 19:10:05,898 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-13 19:10:08,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90517 states. [2021-07-13 19:10:10,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90517 to 90517. [2021-07-13 19:10:10,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90517 states, 90503 states have (on average 2.943394141630664) internal successors, (266386), 90516 states have internal predecessors, (266386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:10,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90517 states to 90517 states and 266386 transitions. [2021-07-13 19:10:10,901 INFO L78 Accepts]: Start accepts. Automaton has 90517 states and 266386 transitions. Word has length 58 [2021-07-13 19:10:10,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:10:10,902 INFO L482 AbstractCegarLoop]: Abstraction has 90517 states and 266386 transitions. [2021-07-13 19:10:10,902 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:10,902 INFO L276 IsEmpty]: Start isEmpty. Operand 90517 states and 266386 transitions. [2021-07-13 19:10:10,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-07-13 19:10:10,907 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:10:10,907 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:10:10,907 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-07-13 19:10:10,907 INFO L430 AbstractCegarLoop]: === Iteration 2 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:10:10,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:10:10,907 INFO L82 PathProgramCache]: Analyzing trace with hash 256043251, now seen corresponding path program 1 times [2021-07-13 19:10:10,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:10:10,908 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825604816] [2021-07-13 19:10:10,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:10:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:10:10,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 19:10:10,930 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:10:10,930 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825604816] [2021-07-13 19:10:10,930 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825604816] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 19:10:10,930 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 19:10:10,930 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-13 19:10:10,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358370064] [2021-07-13 19:10:10,931 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-13 19:10:10,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:10:10,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-13 19:10:10,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-13 19:10:10,931 INFO L87 Difference]: Start difference. First operand 90517 states and 266386 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:11,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:10:11,720 INFO L93 Difference]: Finished difference Result 90521 states and 266390 transitions. [2021-07-13 19:10:11,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-13 19:10:11,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-07-13 19:10:11,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:10:12,075 INFO L225 Difference]: With dead ends: 90521 [2021-07-13 19:10:12,076 INFO L226 Difference]: Without dead ends: 90521 [2021-07-13 19:10:12,076 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-13 19:10:14,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90521 states. [2021-07-13 19:10:16,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90521 to 90518. [2021-07-13 19:10:16,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90518 states, 90504 states have (on average 2.943372668611332) internal successors, (266387), 90517 states have internal predecessors, (266387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:16,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90518 states to 90518 states and 266387 transitions. [2021-07-13 19:10:16,648 INFO L78 Accepts]: Start accepts. Automaton has 90518 states and 266387 transitions. Word has length 58 [2021-07-13 19:10:16,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:10:16,649 INFO L482 AbstractCegarLoop]: Abstraction has 90518 states and 266387 transitions. [2021-07-13 19:10:16,649 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:16,649 INFO L276 IsEmpty]: Start isEmpty. Operand 90518 states and 266387 transitions. [2021-07-13 19:10:16,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-07-13 19:10:16,656 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:10:16,656 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:10:16,656 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-07-13 19:10:16,656 INFO L430 AbstractCegarLoop]: === Iteration 3 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:10:16,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:10:16,657 INFO L82 PathProgramCache]: Analyzing trace with hash 141175930, now seen corresponding path program 1 times [2021-07-13 19:10:16,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:10:16,657 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838496223] [2021-07-13 19:10:16,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:10:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:10:16,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 19:10:16,686 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:10:16,686 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838496223] [2021-07-13 19:10:16,686 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838496223] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:10:16,686 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071136244] [2021-07-13 19:10:16,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:10:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:10:16,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2021-07-13 19:10:16,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:10:16,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 19:10:16,863 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071136244] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:10:16,863 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:10:16,863 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-07-13 19:10:16,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291228492] [2021-07-13 19:10:16,864 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-13 19:10:16,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:10:16,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-13 19:10:16,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-07-13 19:10:16,865 INFO L87 Difference]: Start difference. First operand 90518 states and 266387 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:17,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:10:17,838 INFO L93 Difference]: Finished difference Result 90526 states and 266395 transitions. [2021-07-13 19:10:17,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-13 19:10:17,838 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-07-13 19:10:17,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:10:18,106 INFO L225 Difference]: With dead ends: 90526 [2021-07-13 19:10:18,106 INFO L226 Difference]: Without dead ends: 90526 [2021-07-13 19:10:18,106 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 26.8ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-07-13 19:10:20,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90526 states. [2021-07-13 19:10:22,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90526 to 90523. [2021-07-13 19:10:22,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90523 states, 90509 states have (on average 2.943265310632092) internal successors, (266392), 90522 states have internal predecessors, (266392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:22,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90523 states to 90523 states and 266392 transitions. [2021-07-13 19:10:22,651 INFO L78 Accepts]: Start accepts. Automaton has 90523 states and 266392 transitions. Word has length 63 [2021-07-13 19:10:22,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:10:22,651 INFO L482 AbstractCegarLoop]: Abstraction has 90523 states and 266392 transitions. [2021-07-13 19:10:22,651 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:22,651 INFO L276 IsEmpty]: Start isEmpty. Operand 90523 states and 266392 transitions. [2021-07-13 19:10:22,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-07-13 19:10:22,656 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:10:22,657 INFO L508 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:10:22,872 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:10:22,873 INFO L430 AbstractCegarLoop]: === Iteration 4 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:10:22,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:10:22,873 INFO L82 PathProgramCache]: Analyzing trace with hash -357366445, now seen corresponding path program 2 times [2021-07-13 19:10:22,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:10:22,873 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397109621] [2021-07-13 19:10:22,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:10:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:10:22,913 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 19:10:22,913 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:10:22,913 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397109621] [2021-07-13 19:10:22,913 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397109621] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:10:22,913 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831719663] [2021-07-13 19:10:22,913 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:10:23,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-07-13 19:10:23,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-13 19:10:23,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjunts are in the unsatisfiable core [2021-07-13 19:10:23,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:10:23,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-07-13 19:10:23,026 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:10:23,027 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:10:23,028 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:10:23,028 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-13 19:10:23,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-07-13 19:10:23,041 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:10:23,044 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:10:23,045 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:10:23,045 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-13 19:10:23,100 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-13 19:10:23,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-07-13 19:10:23,102 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:10:23,105 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:10:23,106 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:10:23,106 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-13 19:10:23,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-13 19:10:23,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-13 19:10:23,155 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:10:23,159 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:10:23,159 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:10:23,164 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:10:23,166 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:10:23,166 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-07-13 19:10:23,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 18 treesize of output 14 [2021-07-13 19:10:23,703 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:10:23,704 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:10:23,706 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-07-13 19:10:23,706 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:18, output treesize:10 [2021-07-13 19:10:23,764 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-07-13 19:10:23,764 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831719663] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 19:10:23,764 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-07-13 19:10:23,764 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2021-07-13 19:10:23,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154404934] [2021-07-13 19:10:23,764 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-13 19:10:23,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:10:23,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-13 19:10:23,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-07-13 19:10:23,765 INFO L87 Difference]: Start difference. First operand 90523 states and 266392 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:25,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:10:25,342 INFO L93 Difference]: Finished difference Result 115429 states and 334822 transitions. [2021-07-13 19:10:25,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-07-13 19:10:25,342 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-07-13 19:10:25,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:10:25,588 INFO L225 Difference]: With dead ends: 115429 [2021-07-13 19:10:25,588 INFO L226 Difference]: Without dead ends: 86445 [2021-07-13 19:10:25,589 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 223.9ms TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2021-07-13 19:10:27,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86445 states. [2021-07-13 19:10:29,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86445 to 84469. [2021-07-13 19:10:29,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84469 states, 84460 states have (on average 2.9208382666350934) internal successors, (246694), 84468 states have internal predecessors, (246694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:29,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84469 states to 84469 states and 246694 transitions. [2021-07-13 19:10:29,499 INFO L78 Accepts]: Start accepts. Automaton has 84469 states and 246694 transitions. Word has length 68 [2021-07-13 19:10:29,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:10:29,499 INFO L482 AbstractCegarLoop]: Abstraction has 84469 states and 246694 transitions. [2021-07-13 19:10:29,499 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:29,499 INFO L276 IsEmpty]: Start isEmpty. Operand 84469 states and 246694 transitions. [2021-07-13 19:10:29,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-07-13 19:10:29,538 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:10:29,538 INFO L508 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:10:29,752 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-07-13 19:10:29,753 INFO L430 AbstractCegarLoop]: === Iteration 5 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:10:29,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:10:29,753 INFO L82 PathProgramCache]: Analyzing trace with hash -34686965, now seen corresponding path program 1 times [2021-07-13 19:10:29,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:10:29,753 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524844600] [2021-07-13 19:10:29,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:10:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:10:29,792 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-07-13 19:10:29,792 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:10:29,792 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524844600] [2021-07-13 19:10:29,792 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524844600] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:10:29,792 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879230082] [2021-07-13 19:10:29,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:10:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:10:29,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 2 conjunts are in the unsatisfiable core [2021-07-13 19:10:29,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:10:29,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-07-13 19:10:29,981 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:10:29,983 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:10:29,984 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:10:29,984 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2021-07-13 19:10:30,008 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-07-13 19:10:30,009 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879230082] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 19:10:30,009 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-07-13 19:10:30,009 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-07-13 19:10:30,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332944366] [2021-07-13 19:10:30,009 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-13 19:10:30,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:10:30,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-13 19:10:30,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-07-13 19:10:30,010 INFO L87 Difference]: Start difference. First operand 84469 states and 246694 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:30,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:10:30,889 INFO L93 Difference]: Finished difference Result 76063 states and 215844 transitions. [2021-07-13 19:10:30,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-13 19:10:30,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-07-13 19:10:30,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:10:31,074 INFO L225 Difference]: With dead ends: 76063 [2021-07-13 19:10:31,074 INFO L226 Difference]: Without dead ends: 72969 [2021-07-13 19:10:31,074 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 12.8ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-07-13 19:10:32,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72969 states. [2021-07-13 19:10:33,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72969 to 70961. [2021-07-13 19:10:33,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70961 states, 70935 states have (on average 2.845393670261507) internal successors, (201838), 70960 states have internal predecessors, (201838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:33,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70961 states to 70961 states and 201838 transitions. [2021-07-13 19:10:33,870 INFO L78 Accepts]: Start accepts. Automaton has 70961 states and 201838 transitions. Word has length 85 [2021-07-13 19:10:33,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:10:33,870 INFO L482 AbstractCegarLoop]: Abstraction has 70961 states and 201838 transitions. [2021-07-13 19:10:33,870 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:33,870 INFO L276 IsEmpty]: Start isEmpty. Operand 70961 states and 201838 transitions. [2021-07-13 19:10:33,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-07-13 19:10:33,906 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:10:33,906 INFO L508 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:10:34,118 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:10:34,118 INFO L430 AbstractCegarLoop]: === Iteration 6 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:10:34,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:10:34,119 INFO L82 PathProgramCache]: Analyzing trace with hash 856318943, now seen corresponding path program 1 times [2021-07-13 19:10:34,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:10:34,119 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874925688] [2021-07-13 19:10:34,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:10:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:10:34,147 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-07-13 19:10:34,147 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:10:34,147 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874925688] [2021-07-13 19:10:34,148 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874925688] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:10:34,148 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917502814] [2021-07-13 19:10:34,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:10:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:10:34,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2021-07-13 19:10:34,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:10:34,389 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-07-13 19:10:34,389 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917502814] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:10:34,389 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:10:34,389 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2021-07-13 19:10:34,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775285842] [2021-07-13 19:10:34,390 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-13 19:10:34,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:10:34,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-13 19:10:34,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-07-13 19:10:34,391 INFO L87 Difference]: Start difference. First operand 70961 states and 201838 transitions. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:35,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:10:35,087 INFO L93 Difference]: Finished difference Result 70409 states and 200744 transitions. [2021-07-13 19:10:35,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-13 19:10:35,088 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-07-13 19:10:35,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:10:35,258 INFO L225 Difference]: With dead ends: 70409 [2021-07-13 19:10:35,258 INFO L226 Difference]: Without dead ends: 70409 [2021-07-13 19:10:35,258 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 77.9ms TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-07-13 19:10:36,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70409 states. [2021-07-13 19:10:37,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70409 to 70406. [2021-07-13 19:10:37,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70406 states, 70381 states have (on average 2.852204430172916) internal successors, (200741), 70405 states have internal predecessors, (200741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:38,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70406 states to 70406 states and 200741 transitions. [2021-07-13 19:10:38,035 INFO L78 Accepts]: Start accepts. Automaton has 70406 states and 200741 transitions. Word has length 88 [2021-07-13 19:10:38,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:10:38,035 INFO L482 AbstractCegarLoop]: Abstraction has 70406 states and 200741 transitions. [2021-07-13 19:10:38,035 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:38,035 INFO L276 IsEmpty]: Start isEmpty. Operand 70406 states and 200741 transitions. [2021-07-13 19:10:38,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-07-13 19:10:38,101 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:10:38,101 INFO L508 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:10:38,309 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-07-13 19:10:38,309 INFO L430 AbstractCegarLoop]: === Iteration 7 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:10:38,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:10:38,309 INFO L82 PathProgramCache]: Analyzing trace with hash 53633985, now seen corresponding path program 1 times [2021-07-13 19:10:38,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:10:38,309 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892046708] [2021-07-13 19:10:38,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:10:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:10:38,373 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-07-13 19:10:38,373 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:10:38,373 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892046708] [2021-07-13 19:10:38,373 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892046708] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:10:38,373 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8042219] [2021-07-13 19:10:38,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:10:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:10:38,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2021-07-13 19:10:38,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:10:38,593 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-07-13 19:10:38,594 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8042219] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:10:38,594 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:10:38,594 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-07-13 19:10:38,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110023524] [2021-07-13 19:10:38,594 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-13 19:10:38,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:10:38,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-13 19:10:38,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-07-13 19:10:38,595 INFO L87 Difference]: Start difference. First operand 70406 states and 200741 transitions. Second operand has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:39,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:10:39,254 INFO L93 Difference]: Finished difference Result 70414 states and 200749 transitions. [2021-07-13 19:10:39,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-13 19:10:39,255 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-07-13 19:10:39,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:10:39,419 INFO L225 Difference]: With dead ends: 70414 [2021-07-13 19:10:39,419 INFO L226 Difference]: Without dead ends: 70414 [2021-07-13 19:10:39,420 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 72.1ms TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-07-13 19:10:40,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70414 states. [2021-07-13 19:10:41,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70414 to 70411. [2021-07-13 19:10:41,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70411 states, 70386 states have (on average 2.85207285539738) internal successors, (200746), 70410 states have internal predecessors, (200746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:42,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70411 states to 70411 states and 200746 transitions. [2021-07-13 19:10:42,156 INFO L78 Accepts]: Start accepts. Automaton has 70411 states and 200746 transitions. Word has length 103 [2021-07-13 19:10:42,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:10:42,157 INFO L482 AbstractCegarLoop]: Abstraction has 70411 states and 200746 transitions. [2021-07-13 19:10:42,157 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:42,157 INFO L276 IsEmpty]: Start isEmpty. Operand 70411 states and 200746 transitions. [2021-07-13 19:10:42,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-07-13 19:10:42,245 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:10:42,246 INFO L508 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:10:42,466 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-07-13 19:10:42,467 INFO L430 AbstractCegarLoop]: === Iteration 8 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:10:42,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:10:42,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1434955674, now seen corresponding path program 2 times [2021-07-13 19:10:42,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:10:42,467 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682696625] [2021-07-13 19:10:42,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:10:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:10:42,545 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-07-13 19:10:42,546 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:10:42,546 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682696625] [2021-07-13 19:10:42,546 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682696625] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:10:42,546 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124648567] [2021-07-13 19:10:42,546 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:10:42,626 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-07-13 19:10:42,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-13 19:10:42,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 10 conjunts are in the unsatisfiable core [2021-07-13 19:10:42,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:10:42,777 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-07-13 19:10:42,777 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124648567] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:10:42,777 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:10:42,777 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-07-13 19:10:42,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147101651] [2021-07-13 19:10:42,778 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-13 19:10:42,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:10:42,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-13 19:10:42,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-07-13 19:10:42,778 INFO L87 Difference]: Start difference. First operand 70411 states and 200746 transitions. Second operand has 13 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:43,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:10:43,161 INFO L93 Difference]: Finished difference Result 70419 states and 200754 transitions. [2021-07-13 19:10:43,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-07-13 19:10:43,161 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2021-07-13 19:10:43,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:10:43,317 INFO L225 Difference]: With dead ends: 70419 [2021-07-13 19:10:43,317 INFO L226 Difference]: Without dead ends: 70419 [2021-07-13 19:10:43,317 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 113.2ms TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2021-07-13 19:10:44,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70419 states. [2021-07-13 19:10:45,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70419 to 70416. [2021-07-13 19:10:45,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70416 states, 70391 states have (on average 2.851941299313833) internal successors, (200751), 70415 states have internal predecessors, (200751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:45,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70416 states to 70416 states and 200751 transitions. [2021-07-13 19:10:45,980 INFO L78 Accepts]: Start accepts. Automaton has 70416 states and 200751 transitions. Word has length 108 [2021-07-13 19:10:45,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:10:45,980 INFO L482 AbstractCegarLoop]: Abstraction has 70416 states and 200751 transitions. [2021-07-13 19:10:45,980 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:45,981 INFO L276 IsEmpty]: Start isEmpty. Operand 70416 states and 200751 transitions. [2021-07-13 19:10:46,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-07-13 19:10:46,037 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:10:46,037 INFO L508 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:10:46,238 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-07-13 19:10:46,238 INFO L430 AbstractCegarLoop]: === Iteration 9 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:10:46,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:10:46,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1642798239, now seen corresponding path program 3 times [2021-07-13 19:10:46,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:10:46,238 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844985636] [2021-07-13 19:10:46,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:10:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:10:46,357 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-07-13 19:10:46,357 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:10:46,357 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844985636] [2021-07-13 19:10:46,357 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844985636] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:10:46,357 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660209132] [2021-07-13 19:10:46,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:10:46,807 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-07-13 19:10:46,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-13 19:10:46,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjunts are in the unsatisfiable core [2021-07-13 19:10:46,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:10:47,031 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-07-13 19:10:47,031 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660209132] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:10:47,031 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:10:47,031 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 18 [2021-07-13 19:10:47,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282044934] [2021-07-13 19:10:47,032 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-07-13 19:10:47,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:10:47,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-07-13 19:10:47,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-07-13 19:10:47,032 INFO L87 Difference]: Start difference. First operand 70416 states and 200751 transitions. Second operand has 18 states, 18 states have (on average 8.444444444444445) internal successors, (152), 18 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:47,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:10:47,282 INFO L93 Difference]: Finished difference Result 11406 states and 31717 transitions. [2021-07-13 19:10:47,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-07-13 19:10:47,283 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.444444444444445) internal successors, (152), 18 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2021-07-13 19:10:47,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:10:47,297 INFO L225 Difference]: With dead ends: 11406 [2021-07-13 19:10:47,298 INFO L226 Difference]: Without dead ends: 9498 [2021-07-13 19:10:47,298 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 250.6ms TimeCoverageRelationStatistics Valid=220, Invalid=772, Unknown=0, NotChecked=0, Total=992 [2021-07-13 19:10:47,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9498 states. [2021-07-13 19:10:47,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9498 to 9351. [2021-07-13 19:10:47,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9351 states, 9349 states have (on average 2.788961386244518) internal successors, (26074), 9350 states have internal predecessors, (26074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:47,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9351 states to 9351 states and 26074 transitions. [2021-07-13 19:10:47,463 INFO L78 Accepts]: Start accepts. Automaton has 9351 states and 26074 transitions. Word has length 113 [2021-07-13 19:10:47,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:10:47,463 INFO L482 AbstractCegarLoop]: Abstraction has 9351 states and 26074 transitions. [2021-07-13 19:10:47,463 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 8.444444444444445) internal successors, (152), 18 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:47,463 INFO L276 IsEmpty]: Start isEmpty. Operand 9351 states and 26074 transitions. [2021-07-13 19:10:47,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-07-13 19:10:47,475 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:10:47,475 INFO L508 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:10:47,688 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-07-13 19:10:47,689 INFO L430 AbstractCegarLoop]: === Iteration 10 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:10:47,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:10:47,689 INFO L82 PathProgramCache]: Analyzing trace with hash 890682539, now seen corresponding path program 1 times [2021-07-13 19:10:47,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:10:47,689 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969950051] [2021-07-13 19:10:47,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:10:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:10:47,800 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-13 19:10:47,801 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:10:47,801 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969950051] [2021-07-13 19:10:47,802 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969950051] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:10:47,802 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652090668] [2021-07-13 19:10:47,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:10:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:10:47,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 14 conjunts are in the unsatisfiable core [2021-07-13 19:10:47,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:10:48,044 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-13 19:10:48,045 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652090668] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:10:48,045 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:10:48,045 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2021-07-13 19:10:48,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96052210] [2021-07-13 19:10:48,045 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-07-13 19:10:48,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:10:48,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-07-13 19:10:48,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-07-13 19:10:48,046 INFO L87 Difference]: Start difference. First operand 9351 states and 26074 transitions. Second operand has 17 states, 17 states have (on average 7.352941176470588) internal successors, (125), 17 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:48,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:10:48,384 INFO L93 Difference]: Finished difference Result 9359 states and 26082 transitions. [2021-07-13 19:10:48,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-07-13 19:10:48,384 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.352941176470588) internal successors, (125), 17 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2021-07-13 19:10:48,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:10:48,399 INFO L225 Difference]: With dead ends: 9359 [2021-07-13 19:10:48,399 INFO L226 Difference]: Without dead ends: 9359 [2021-07-13 19:10:48,400 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 176.7ms TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812 [2021-07-13 19:10:48,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9359 states. [2021-07-13 19:10:48,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9359 to 9356. [2021-07-13 19:10:48,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9356 states, 9354 states have (on average 2.7880051314945478) internal successors, (26079), 9355 states have internal predecessors, (26079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:48,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9356 states to 9356 states and 26079 transitions. [2021-07-13 19:10:48,564 INFO L78 Accepts]: Start accepts. Automaton has 9356 states and 26079 transitions. Word has length 124 [2021-07-13 19:10:48,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:10:48,564 INFO L482 AbstractCegarLoop]: Abstraction has 9356 states and 26079 transitions. [2021-07-13 19:10:48,564 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 7.352941176470588) internal successors, (125), 17 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:48,564 INFO L276 IsEmpty]: Start isEmpty. Operand 9356 states and 26079 transitions. [2021-07-13 19:10:48,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-07-13 19:10:48,574 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:10:48,574 INFO L508 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:10:48,775 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-07-13 19:10:48,775 INFO L430 AbstractCegarLoop]: === Iteration 11 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:10:48,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:10:48,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1323926130, now seen corresponding path program 2 times [2021-07-13 19:10:48,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:10:48,775 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949709666] [2021-07-13 19:10:48,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:10:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:10:48,909 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-13 19:10:48,909 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:10:48,909 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949709666] [2021-07-13 19:10:48,909 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949709666] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:10:48,909 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023648773] [2021-07-13 19:10:48,910 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:10:49,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-07-13 19:10:49,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-13 19:10:49,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 16 conjunts are in the unsatisfiable core [2021-07-13 19:10:49,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:10:49,179 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-13 19:10:49,179 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023648773] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:10:49,179 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:10:49,179 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2021-07-13 19:10:49,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324131705] [2021-07-13 19:10:49,180 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-07-13 19:10:49,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:10:49,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-07-13 19:10:49,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-07-13 19:10:49,180 INFO L87 Difference]: Start difference. First operand 9356 states and 26079 transitions. Second operand has 19 states, 19 states have (on average 6.842105263157895) internal successors, (130), 19 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:49,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:10:49,386 INFO L93 Difference]: Finished difference Result 9364 states and 26087 transitions. [2021-07-13 19:10:49,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-07-13 19:10:49,386 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.842105263157895) internal successors, (130), 19 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2021-07-13 19:10:49,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:10:49,400 INFO L225 Difference]: With dead ends: 9364 [2021-07-13 19:10:49,400 INFO L226 Difference]: Without dead ends: 9364 [2021-07-13 19:10:49,400 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 235.1ms TimeCoverageRelationStatistics Valid=340, Invalid=716, Unknown=0, NotChecked=0, Total=1056 [2021-07-13 19:10:49,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9364 states. [2021-07-13 19:10:49,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9364 to 9361. [2021-07-13 19:10:49,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9361 states, 9359 states have (on average 2.7870498984934287) internal successors, (26084), 9360 states have internal predecessors, (26084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:49,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9361 states to 9361 states and 26084 transitions. [2021-07-13 19:10:49,590 INFO L78 Accepts]: Start accepts. Automaton has 9361 states and 26084 transitions. Word has length 129 [2021-07-13 19:10:49,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:10:49,590 INFO L482 AbstractCegarLoop]: Abstraction has 9361 states and 26084 transitions. [2021-07-13 19:10:49,590 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 6.842105263157895) internal successors, (130), 19 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:49,590 INFO L276 IsEmpty]: Start isEmpty. Operand 9361 states and 26084 transitions. [2021-07-13 19:10:49,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-07-13 19:10:49,600 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:10:49,600 INFO L508 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:10:49,804 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:10:49,805 INFO L430 AbstractCegarLoop]: === Iteration 12 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:10:49,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:10:49,805 INFO L82 PathProgramCache]: Analyzing trace with hash 111034635, now seen corresponding path program 3 times [2021-07-13 19:10:49,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:10:49,805 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333733067] [2021-07-13 19:10:49,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:10:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:10:49,975 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-13 19:10:49,975 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:10:49,975 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333733067] [2021-07-13 19:10:49,975 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333733067] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:10:49,975 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450265103] [2021-07-13 19:10:49,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:10:50,083 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-07-13 19:10:50,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-13 19:10:50,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 31 conjunts are in the unsatisfiable core [2021-07-13 19:10:50,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:10:50,108 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-07-13 19:10:50,109 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:10:50,110 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:10:50,111 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:10:50,111 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-13 19:10:50,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-07-13 19:10:50,129 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:10:50,132 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:10:50,133 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:10:50,133 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-13 19:10:50,237 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-13 19:10:50,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-07-13 19:10:50,239 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:10:50,242 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:10:50,243 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:10:50,243 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-13 19:10:50,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-13 19:10:50,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-13 19:10:50,283 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:10:50,287 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:10:50,287 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:10:50,292 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:10:50,294 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:10:50,294 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-07-13 19:10:50,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-07-13 19:10:50,342 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:10:50,347 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:10:50,348 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:10:50,349 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2021-07-13 19:10:50,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-13 19:10:50,397 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-13 19:10:50,397 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:10:50,401 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:10:50,401 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:10:50,407 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:10:50,408 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:10:50,408 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:19 [2021-07-13 19:10:50,565 INFO L354 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2021-07-13 19:10:50,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2021-07-13 19:10:50,567 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:10:50,571 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:10:50,571 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:10:50,571 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:17 [2021-07-13 19:10:50,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 24 treesize of output 19 [2021-07-13 19:10:50,670 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:10:50,673 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:10:50,675 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-07-13 19:10:50,676 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2021-07-13 19:10:52,698 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post39| 1))) (not (= (* 28 c_t_funThread1of2ForFork0_~i~0) (* 28 t_funThread2of2ForFork0_~i~0))))) is different from true [2021-07-13 19:10:52,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 23 [2021-07-13 19:10:52,757 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:10:52,763 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:10:52,766 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-07-13 19:10:52,766 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:35, output treesize:28 [2021-07-13 19:10:52,897 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-07-13 19:10:52,898 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450265103] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:10:52,898 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:10:52,898 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 35 [2021-07-13 19:10:52,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277629978] [2021-07-13 19:10:52,898 INFO L462 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-07-13 19:10:52,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:10:52,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-07-13 19:10:52,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=989, Unknown=1, NotChecked=64, Total=1190 [2021-07-13 19:10:52,899 INFO L87 Difference]: Start difference. First operand 9361 states and 26084 transitions. Second operand has 35 states, 35 states have (on average 6.142857142857143) internal successors, (215), 35 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:56,903 WARN L205 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 26 [2021-07-13 19:10:57,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:10:57,086 INFO L93 Difference]: Finished difference Result 10469 states and 29039 transitions. [2021-07-13 19:10:57,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-07-13 19:10:57,087 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 6.142857142857143) internal successors, (215), 35 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2021-07-13 19:10:57,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:10:57,105 INFO L225 Difference]: With dead ends: 10469 [2021-07-13 19:10:57,105 INFO L226 Difference]: Without dead ends: 10381 [2021-07-13 19:10:57,107 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1439 ImplicationChecksByTransitivity, 5775.9ms TimeCoverageRelationStatistics Valid=907, Invalid=5258, Unknown=1, NotChecked=154, Total=6320 [2021-07-13 19:10:57,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10381 states. [2021-07-13 19:10:57,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10381 to 10202. [2021-07-13 19:10:57,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10202 states, 10200 states have (on average 2.776764705882353) internal successors, (28323), 10201 states have internal predecessors, (28323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:57,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10202 states to 10202 states and 28323 transitions. [2021-07-13 19:10:57,342 INFO L78 Accepts]: Start accepts. Automaton has 10202 states and 28323 transitions. Word has length 134 [2021-07-13 19:10:57,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:10:57,342 INFO L482 AbstractCegarLoop]: Abstraction has 10202 states and 28323 transitions. [2021-07-13 19:10:57,342 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 6.142857142857143) internal successors, (215), 35 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:57,342 INFO L276 IsEmpty]: Start isEmpty. Operand 10202 states and 28323 transitions. [2021-07-13 19:10:57,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-07-13 19:10:57,353 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:10:57,353 INFO L508 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:10:57,554 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:10:57,554 INFO L430 AbstractCegarLoop]: === Iteration 13 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:10:57,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:10:57,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1100044920, now seen corresponding path program 4 times [2021-07-13 19:10:57,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:10:57,557 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81117706] [2021-07-13 19:10:57,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:10:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:10:57,795 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-13 19:10:57,796 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:10:57,796 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81117706] [2021-07-13 19:10:57,796 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81117706] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:10:57,796 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080518983] [2021-07-13 19:10:57,796 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:10:57,889 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-07-13 19:10:57,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-13 19:10:57,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 20 conjunts are in the unsatisfiable core [2021-07-13 19:10:57,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:10:58,084 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-13 19:10:58,085 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080518983] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:10:58,085 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:10:58,085 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2021-07-13 19:10:58,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042705682] [2021-07-13 19:10:58,085 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-07-13 19:10:58,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:10:58,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-07-13 19:10:58,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2021-07-13 19:10:58,086 INFO L87 Difference]: Start difference. First operand 10202 states and 28323 transitions. Second operand has 23 states, 23 states have (on average 6.086956521739131) internal successors, (140), 23 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:58,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:10:58,374 INFO L93 Difference]: Finished difference Result 10207 states and 28328 transitions. [2021-07-13 19:10:58,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-07-13 19:10:58,375 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.086956521739131) internal successors, (140), 23 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2021-07-13 19:10:58,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:10:58,391 INFO L225 Difference]: With dead ends: 10207 [2021-07-13 19:10:58,392 INFO L226 Difference]: Without dead ends: 10207 [2021-07-13 19:10:58,392 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 378.4ms TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2021-07-13 19:10:58,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10207 states. [2021-07-13 19:10:58,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10207 to 10207. [2021-07-13 19:10:58,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10207 states, 10205 states have (on average 2.7758941695247428) internal successors, (28328), 10206 states have internal predecessors, (28328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:58,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10207 states to 10207 states and 28328 transitions. [2021-07-13 19:10:58,618 INFO L78 Accepts]: Start accepts. Automaton has 10207 states and 28328 transitions. Word has length 139 [2021-07-13 19:10:58,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:10:58,618 INFO L482 AbstractCegarLoop]: Abstraction has 10207 states and 28328 transitions. [2021-07-13 19:10:58,618 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 6.086956521739131) internal successors, (140), 23 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:10:58,618 INFO L276 IsEmpty]: Start isEmpty. Operand 10207 states and 28328 transitions. [2021-07-13 19:10:58,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-07-13 19:10:58,629 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:10:58,630 INFO L508 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:10:58,831 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:10:58,832 INFO L430 AbstractCegarLoop]: === Iteration 14 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:10:58,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:10:58,832 INFO L82 PathProgramCache]: Analyzing trace with hash 511490273, now seen corresponding path program 5 times [2021-07-13 19:10:58,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:10:58,832 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306747400] [2021-07-13 19:10:58,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:10:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:10:59,589 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-13 19:10:59,590 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:10:59,590 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306747400] [2021-07-13 19:10:59,590 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306747400] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:10:59,590 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094334071] [2021-07-13 19:10:59,590 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:10:59,737 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2021-07-13 19:10:59,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-13 19:10:59,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 31 conjunts are in the unsatisfiable core [2021-07-13 19:10:59,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:10:59,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-07-13 19:10:59,765 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:10:59,767 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:10:59,767 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:10:59,767 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-13 19:10:59,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-07-13 19:10:59,775 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:10:59,779 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:10:59,780 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:10:59,780 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-13 19:10:59,897 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-13 19:10:59,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-07-13 19:10:59,900 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:10:59,903 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:10:59,904 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:10:59,904 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-13 19:10:59,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-13 19:10:59,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-13 19:10:59,927 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:10:59,931 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:10:59,932 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:10:59,938 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:10:59,939 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:10:59,939 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-07-13 19:10:59,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-07-13 19:10:59,998 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:11:00,004 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:11:00,006 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:11:00,006 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2021-07-13 19:11:00,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-13 19:11:00,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-13 19:11:00,078 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:11:00,083 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:11:00,084 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:11:00,096 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:11:00,098 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:11:00,098 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:19 [2021-07-13 19:11:00,244 INFO L354 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2021-07-13 19:11:00,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2021-07-13 19:11:00,247 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:11:00,251 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:11:00,252 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:11:00,252 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:17 [2021-07-13 19:11:00,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 24 treesize of output 19 [2021-07-13 19:11:00,455 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:11:00,459 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:11:00,461 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-07-13 19:11:00,461 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2021-07-13 19:11:02,479 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post39| 1))) (not (= (* 28 c_t_funThread1of2ForFork0_~i~0) (* 28 t_funThread2of2ForFork0_~i~0))))) is different from true [2021-07-13 19:11:02,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 23 [2021-07-13 19:11:02,559 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:11:02,564 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:11:02,567 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-07-13 19:11:02,568 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:35, output treesize:28 [2021-07-13 19:11:03,544 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-13 19:11:03,544 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094334071] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:11:03,545 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:11:03,545 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 35 [2021-07-13 19:11:03,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395420397] [2021-07-13 19:11:03,545 INFO L462 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-07-13 19:11:03,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:11:03,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-07-13 19:11:03,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1006, Unknown=2, NotChecked=64, Total=1190 [2021-07-13 19:11:03,546 INFO L87 Difference]: Start difference. First operand 10207 states and 28328 transitions. Second operand has 35 states, 35 states have (on average 4.485714285714286) internal successors, (157), 35 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:11:05,014 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2021-07-13 19:11:07,765 WARN L205 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2021-07-13 19:14:45,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:14:45,123 INFO L93 Difference]: Finished difference Result 12751 states and 35118 transitions. [2021-07-13 19:14:45,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-07-13 19:14:45,130 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 4.485714285714286) internal successors, (157), 35 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2021-07-13 19:14:45,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:14:45,148 INFO L225 Difference]: With dead ends: 12751 [2021-07-13 19:14:45,148 INFO L226 Difference]: Without dead ends: 11671 [2021-07-13 19:14:45,149 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 133 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1557 ImplicationChecksByTransitivity, 59132.2ms TimeCoverageRelationStatistics Valid=782, Invalid=5193, Unknown=35, NotChecked=152, Total=6162 [2021-07-13 19:14:45,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11671 states. [2021-07-13 19:14:45,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11671 to 10928. [2021-07-13 19:14:45,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10928 states, 10926 states have (on average 2.774757459271463) internal successors, (30317), 10927 states have internal predecessors, (30317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:14:45,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10928 states to 10928 states and 30317 transitions. [2021-07-13 19:14:45,337 INFO L78 Accepts]: Start accepts. Automaton has 10928 states and 30317 transitions. Word has length 144 [2021-07-13 19:14:45,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:14:45,337 INFO L482 AbstractCegarLoop]: Abstraction has 10928 states and 30317 transitions. [2021-07-13 19:14:45,337 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 4.485714285714286) internal successors, (157), 35 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:14:45,337 INFO L276 IsEmpty]: Start isEmpty. Operand 10928 states and 30317 transitions. [2021-07-13 19:14:45,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-07-13 19:14:45,353 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:14:45,353 INFO L508 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:14:45,556 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-07-13 19:14:45,557 INFO L430 AbstractCegarLoop]: === Iteration 15 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:14:45,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:14:45,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1093189177, now seen corresponding path program 6 times [2021-07-13 19:14:45,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:14:45,557 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444277663] [2021-07-13 19:14:45,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:14:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:14:45,902 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-13 19:14:45,902 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:14:45,902 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444277663] [2021-07-13 19:14:45,902 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444277663] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:14:45,902 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732417577] [2021-07-13 19:14:45,902 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:14:45,996 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-07-13 19:14:45,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-13 19:14:45,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 31 conjunts are in the unsatisfiable core [2021-07-13 19:14:45,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:14:46,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-07-13 19:14:46,025 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:14:46,026 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:14:46,027 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:14:46,027 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-13 19:14:46,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-07-13 19:14:46,033 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:14:46,037 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:14:46,038 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:14:46,038 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-13 19:14:46,152 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-13 19:14:46,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-07-13 19:14:46,154 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:14:46,158 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:14:46,159 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:14:46,159 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-13 19:14:46,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-13 19:14:46,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-13 19:14:46,184 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:14:46,188 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:14:46,189 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:14:46,195 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:14:46,197 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:14:46,197 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-07-13 19:14:46,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-07-13 19:14:46,233 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:14:46,241 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:14:46,243 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-07-13 19:14:46,243 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2021-07-13 19:14:46,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-13 19:14:46,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-13 19:14:46,297 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:14:46,301 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:14:46,302 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:14:46,308 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:14:46,317 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:14:46,318 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:19 [2021-07-13 19:14:46,385 INFO L354 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2021-07-13 19:14:46,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2021-07-13 19:14:46,388 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:14:46,393 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:14:46,394 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:14:46,394 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2021-07-13 19:14:46,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 24 treesize of output 19 [2021-07-13 19:14:46,470 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:14:46,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 24 treesize of output 19 [2021-07-13 19:14:46,475 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:14:46,486 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:14:46,490 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-07-13 19:14:46,490 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:41 [2021-07-13 19:14:47,283 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post39| 1))) (<= (+ |c_t_funThread1of2ForFork0_#t~post35| 2) t_funThread2of2ForFork0_~i~0))) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* v_prenex_1 28) |c_~#a~0.offset|) (+ v_prenex_2 1))) (<= v_prenex_1 |c_t_funThread1of2ForFork0_#t~post35|)))) is different from true [2021-07-13 19:14:48,074 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post39| 1))) (<= (+ c_t_funThread1of2ForFork0_~i~0 1) t_funThread2of2ForFork0_~i~0))) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* v_prenex_1 28) |c_~#a~0.offset|) (+ v_prenex_2 1))) (<= (+ v_prenex_1 1) c_t_funThread1of2ForFork0_~i~0)))) is different from true [2021-07-13 19:14:48,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 23 [2021-07-13 19:14:48,257 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:14:48,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 23 [2021-07-13 19:14:48,263 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:14:48,274 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:14:48,282 INFO L550 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2021-07-13 19:14:48,283 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:65, output treesize:51 [2021-07-13 19:14:48,357 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-13 19:14:48,358 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732417577] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:14:48,358 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:14:48,358 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 23 [2021-07-13 19:14:48,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115557550] [2021-07-13 19:14:48,358 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-07-13 19:14:48,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:14:48,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-07-13 19:14:48,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=354, Unknown=2, NotChecked=78, Total=506 [2021-07-13 19:14:48,359 INFO L87 Difference]: Start difference. First operand 10928 states and 30317 transitions. Second operand has 23 states, 23 states have (on average 5.086956521739131) internal successors, (117), 23 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:14:53,611 WARN L205 SmtUtils]: Spent 4.21 s on a formula simplification. DAG size of input: 54 DAG size of output: 36 [2021-07-13 19:15:04,051 WARN L205 SmtUtils]: Spent 8.34 s on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2021-07-13 19:15:13,825 WARN L205 SmtUtils]: Spent 6.27 s on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2021-07-13 19:15:17,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:15:17,459 INFO L93 Difference]: Finished difference Result 12693 states and 35175 transitions. [2021-07-13 19:15:17,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-07-13 19:15:17,460 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.086956521739131) internal successors, (117), 23 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2021-07-13 19:15:17,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:15:17,481 INFO L225 Difference]: With dead ends: 12693 [2021-07-13 19:15:17,481 INFO L226 Difference]: Without dead ends: 12577 [2021-07-13 19:15:17,482 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 137 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 30319.8ms TimeCoverageRelationStatistics Valid=600, Invalid=2153, Unknown=11, NotChecked=206, Total=2970 [2021-07-13 19:15:17,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12577 states. [2021-07-13 19:15:17,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12577 to 11412. [2021-07-13 19:15:17,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11412 states, 11410 states have (on average 2.7772129710780016) internal successors, (31688), 11411 states have internal predecessors, (31688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:15:17,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11412 states to 11412 states and 31688 transitions. [2021-07-13 19:15:17,720 INFO L78 Accepts]: Start accepts. Automaton has 11412 states and 31688 transitions. Word has length 144 [2021-07-13 19:15:17,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:15:17,720 INFO L482 AbstractCegarLoop]: Abstraction has 11412 states and 31688 transitions. [2021-07-13 19:15:17,721 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 5.086956521739131) internal successors, (117), 23 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:15:17,721 INFO L276 IsEmpty]: Start isEmpty. Operand 11412 states and 31688 transitions. [2021-07-13 19:15:17,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-07-13 19:15:17,731 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:15:17,731 INFO L508 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:15:17,932 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-07-13 19:15:17,932 INFO L430 AbstractCegarLoop]: === Iteration 16 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:15:17,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:15:17,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1416498105, now seen corresponding path program 7 times [2021-07-13 19:15:17,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:15:17,933 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316523319] [2021-07-13 19:15:17,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:15:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:15:18,239 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-13 19:15:18,239 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:15:18,239 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316523319] [2021-07-13 19:15:18,239 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316523319] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:15:18,239 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613434404] [2021-07-13 19:15:18,239 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:15:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:15:18,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 31 conjunts are in the unsatisfiable core [2021-07-13 19:15:18,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:15:18,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-07-13 19:15:18,364 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:15:18,365 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:15:18,366 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:15:18,366 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-13 19:15:18,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-07-13 19:15:18,372 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:15:18,375 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:15:18,376 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:15:18,376 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-13 19:15:18,499 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-13 19:15:18,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-07-13 19:15:18,502 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:15:18,506 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:15:18,507 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:15:18,507 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-13 19:15:18,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-13 19:15:18,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-13 19:15:18,530 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:15:18,534 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:15:18,535 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:15:18,541 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:15:18,542 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:15:18,542 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-07-13 19:15:18,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-07-13 19:15:18,584 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:15:18,593 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:15:18,595 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-07-13 19:15:18,596 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2021-07-13 19:15:18,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-13 19:15:18,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-13 19:15:18,649 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:15:18,654 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:15:18,655 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:15:18,663 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:15:18,665 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:15:18,665 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:19 [2021-07-13 19:15:18,728 INFO L354 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2021-07-13 19:15:18,728 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2021-07-13 19:15:18,731 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:15:18,737 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:15:18,738 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:15:18,738 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2021-07-13 19:15:18,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 24 treesize of output 19 [2021-07-13 19:15:18,840 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:15:18,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 24 treesize of output 19 [2021-07-13 19:15:18,854 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:15:18,865 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:15:18,869 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-07-13 19:15:18,869 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:43 [2021-07-13 19:15:19,685 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post39| 1))) (<= (+ c_t_funThread1of2ForFork0_~i~0 1) t_funThread2of2ForFork0_~i~0))) (exists ((v_prenex_6 Int) (v_prenex_5 Int)) (and (= (store ((as const (Array Int Int)) 0) (+ (* v_prenex_5 28) |c_~#a~0.offset|) (+ v_prenex_6 1)) (select |c_#memory_int| |c_~#a~0.base|)) (<= (+ v_prenex_5 1) c_t_funThread1of2ForFork0_~i~0)))) is different from true [2021-07-13 19:15:19,864 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 23 [2021-07-13 19:15:19,865 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:15:19,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 23 [2021-07-13 19:15:19,870 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:15:19,884 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:15:19,889 INFO L550 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2021-07-13 19:15:19,889 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:65, output treesize:51 [2021-07-13 19:15:19,980 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-13 19:15:19,980 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613434404] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:15:19,980 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:15:19,981 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 23 [2021-07-13 19:15:19,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455583672] [2021-07-13 19:15:19,981 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-07-13 19:15:19,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:15:19,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-07-13 19:15:19,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=400, Unknown=1, NotChecked=40, Total=506 [2021-07-13 19:15:19,982 INFO L87 Difference]: Start difference. First operand 11412 states and 31688 transitions. Second operand has 23 states, 23 states have (on average 5.086956521739131) internal successors, (117), 23 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:15:26,969 WARN L205 SmtUtils]: Spent 5.62 s on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2021-07-13 19:15:30,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:15:30,719 INFO L93 Difference]: Finished difference Result 14331 states and 39517 transitions. [2021-07-13 19:15:30,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-07-13 19:15:30,720 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.086956521739131) internal successors, (117), 23 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2021-07-13 19:15:30,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:15:30,741 INFO L225 Difference]: With dead ends: 14331 [2021-07-13 19:15:30,741 INFO L226 Difference]: Without dead ends: 13515 [2021-07-13 19:15:30,742 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 137 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 11125.5ms TimeCoverageRelationStatistics Valid=483, Invalid=2272, Unknown=5, NotChecked=102, Total=2862 [2021-07-13 19:15:30,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13515 states. [2021-07-13 19:15:30,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13515 to 11412. [2021-07-13 19:15:30,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11412 states, 11410 states have (on average 2.7754601226993865) internal successors, (31668), 11411 states have internal predecessors, (31668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:15:30,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11412 states to 11412 states and 31668 transitions. [2021-07-13 19:15:30,996 INFO L78 Accepts]: Start accepts. Automaton has 11412 states and 31668 transitions. Word has length 144 [2021-07-13 19:15:30,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:15:30,996 INFO L482 AbstractCegarLoop]: Abstraction has 11412 states and 31668 transitions. [2021-07-13 19:15:30,997 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 5.086956521739131) internal successors, (117), 23 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:15:30,997 INFO L276 IsEmpty]: Start isEmpty. Operand 11412 states and 31668 transitions. [2021-07-13 19:15:31,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-07-13 19:15:31,007 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:15:31,008 INFO L508 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:15:31,208 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-07-13 19:15:31,208 INFO L430 AbstractCegarLoop]: === Iteration 17 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:15:31,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:15:31,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1457767975, now seen corresponding path program 8 times [2021-07-13 19:15:31,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:15:31,209 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184154611] [2021-07-13 19:15:31,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:15:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:15:31,498 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-13 19:15:31,499 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:15:31,499 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184154611] [2021-07-13 19:15:31,499 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184154611] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:15:31,499 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729666010] [2021-07-13 19:15:31,499 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:15:31,599 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-07-13 19:15:31,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-13 19:15:31,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 31 conjunts are in the unsatisfiable core [2021-07-13 19:15:31,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:15:31,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-07-13 19:15:31,624 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:15:31,626 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:15:31,626 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:15:31,626 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-13 19:15:31,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-07-13 19:15:31,634 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:15:31,637 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:15:31,638 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:15:31,638 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-13 19:15:31,734 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-13 19:15:31,734 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-07-13 19:15:31,736 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:15:31,740 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:15:31,741 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:15:31,741 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-13 19:15:31,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-13 19:15:31,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-13 19:15:31,762 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:15:31,766 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:15:31,767 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:15:31,772 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:15:31,773 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:15:31,774 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-07-13 19:15:31,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-07-13 19:15:31,809 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:15:31,817 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:15:31,819 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-07-13 19:15:31,819 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2021-07-13 19:15:31,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-13 19:15:31,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-13 19:15:31,864 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:15:31,869 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:15:31,870 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:15:31,877 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:15:31,879 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:15:31,879 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:19 [2021-07-13 19:15:31,948 INFO L354 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2021-07-13 19:15:31,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2021-07-13 19:15:31,950 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:15:31,956 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:15:31,957 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:15:31,957 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2021-07-13 19:15:32,095 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 24 treesize of output 19 [2021-07-13 19:15:32,096 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:15:32,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 24 treesize of output 19 [2021-07-13 19:15:32,100 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:15:32,111 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:15:32,115 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-07-13 19:15:32,115 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:43 [2021-07-13 19:15:32,917 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post39| 1))) (<= (+ c_t_funThread1of2ForFork0_~i~0 1) t_funThread2of2ForFork0_~i~0))) (exists ((v_prenex_10 Int) (v_prenex_9 Int)) (and (= (store ((as const (Array Int Int)) 0) (+ |c_~#a~0.offset| (* v_prenex_9 28)) (+ v_prenex_10 1)) (select |c_#memory_int| |c_~#a~0.base|)) (<= (+ v_prenex_9 1) c_t_funThread1of2ForFork0_~i~0)))) is different from true [2021-07-13 19:15:33,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 23 [2021-07-13 19:15:33,057 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:15:33,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 23 [2021-07-13 19:15:33,061 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:15:33,074 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:15:33,078 INFO L550 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2021-07-13 19:15:33,079 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:65, output treesize:51 [2021-07-13 19:15:33,172 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-13 19:15:33,172 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729666010] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:15:33,172 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:15:33,172 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2021-07-13 19:15:33,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423168919] [2021-07-13 19:15:33,172 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-07-13 19:15:33,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:15:33,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-07-13 19:15:33,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=440, Unknown=1, NotChecked=42, Total=552 [2021-07-13 19:15:33,173 INFO L87 Difference]: Start difference. First operand 11412 states and 31668 transitions. Second operand has 24 states, 24 states have (on average 5.291666666666667) internal successors, (127), 24 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:15:41,130 WARN L205 SmtUtils]: Spent 6.59 s on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2021-07-13 19:15:44,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:15:44,747 INFO L93 Difference]: Finished difference Result 14332 states and 39479 transitions. [2021-07-13 19:15:44,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-07-13 19:15:44,748 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.291666666666667) internal successors, (127), 24 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2021-07-13 19:15:44,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:15:44,771 INFO L225 Difference]: With dead ends: 14332 [2021-07-13 19:15:44,771 INFO L226 Difference]: Without dead ends: 13506 [2021-07-13 19:15:44,772 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 136 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 11995.1ms TimeCoverageRelationStatistics Valid=522, Invalid=2557, Unknown=5, NotChecked=108, Total=3192 [2021-07-13 19:15:44,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13506 states. [2021-07-13 19:15:44,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13506 to 11412. [2021-07-13 19:15:45,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11412 states, 11410 states have (on average 2.775284837861525) internal successors, (31666), 11411 states have internal predecessors, (31666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:15:45,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11412 states to 11412 states and 31666 transitions. [2021-07-13 19:15:45,026 INFO L78 Accepts]: Start accepts. Automaton has 11412 states and 31666 transitions. Word has length 144 [2021-07-13 19:15:45,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:15:45,026 INFO L482 AbstractCegarLoop]: Abstraction has 11412 states and 31666 transitions. [2021-07-13 19:15:45,026 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 5.291666666666667) internal successors, (127), 24 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:15:45,027 INFO L276 IsEmpty]: Start isEmpty. Operand 11412 states and 31666 transitions. [2021-07-13 19:15:45,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-07-13 19:15:45,038 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:15:45,038 INFO L508 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:15:45,244 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:15:45,245 INFO L430 AbstractCegarLoop]: === Iteration 18 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:15:45,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:15:45,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1729739729, now seen corresponding path program 9 times [2021-07-13 19:15:45,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:15:45,245 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876198395] [2021-07-13 19:15:45,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:15:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:15:45,549 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-13 19:15:45,550 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:15:45,550 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876198395] [2021-07-13 19:15:45,550 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876198395] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:15:45,550 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262947151] [2021-07-13 19:15:45,550 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:15:45,638 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-07-13 19:15:45,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-13 19:15:45,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 31 conjunts are in the unsatisfiable core [2021-07-13 19:15:45,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:15:45,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-07-13 19:15:45,659 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:15:45,661 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:15:45,661 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:15:45,661 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-13 19:15:45,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-07-13 19:15:45,668 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:15:45,671 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:15:45,671 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:15:45,671 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-13 19:15:45,772 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-13 19:15:45,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-07-13 19:15:45,774 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:15:45,778 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:15:45,779 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:15:45,779 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-13 19:15:45,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-13 19:15:45,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-13 19:15:45,798 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:15:45,803 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:15:45,804 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:15:45,809 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:15:45,811 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:15:45,811 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-07-13 19:15:45,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-07-13 19:15:45,847 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:15:45,856 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:15:45,858 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-07-13 19:15:45,858 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2021-07-13 19:15:45,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-13 19:15:45,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-13 19:15:45,908 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:15:45,913 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:15:45,914 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:15:45,921 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:15:45,923 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:15:45,924 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:19 [2021-07-13 19:15:45,976 INFO L354 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2021-07-13 19:15:45,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2021-07-13 19:15:45,977 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:15:45,981 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:15:45,982 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:15:45,982 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2021-07-13 19:15:46,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 24 treesize of output 19 [2021-07-13 19:15:46,100 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:15:46,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 24 treesize of output 19 [2021-07-13 19:15:46,105 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:15:46,114 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:15:46,117 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-07-13 19:15:46,117 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:43 [2021-07-13 19:15:46,908 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post39| 1))) (<= (+ c_t_funThread1of2ForFork0_~i~0 1) t_funThread2of2ForFork0_~i~0))) (exists ((v_prenex_14 Int) (v_prenex_13 Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* v_prenex_13 28) |c_~#a~0.offset|) (+ v_prenex_14 1))) (<= (+ v_prenex_13 1) c_t_funThread1of2ForFork0_~i~0)))) is different from true [2021-07-13 19:15:47,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 23 [2021-07-13 19:15:47,046 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:15:47,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 23 [2021-07-13 19:15:47,050 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:15:47,063 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:15:47,068 INFO L550 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2021-07-13 19:15:47,068 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:65, output treesize:51 [2021-07-13 19:15:47,165 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-13 19:15:47,165 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262947151] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:15:47,165 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:15:47,166 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 25 [2021-07-13 19:15:47,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17547022] [2021-07-13 19:15:47,166 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-07-13 19:15:47,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:15:47,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-07-13 19:15:47,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=482, Unknown=1, NotChecked=44, Total=600 [2021-07-13 19:15:47,167 INFO L87 Difference]: Start difference. First operand 11412 states and 31666 transitions. Second operand has 25 states, 25 states have (on average 5.12) internal successors, (128), 25 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:15:54,149 WARN L205 SmtUtils]: Spent 5.68 s on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2021-07-13 19:15:57,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:15:57,675 INFO L93 Difference]: Finished difference Result 14431 states and 39743 transitions. [2021-07-13 19:15:57,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-07-13 19:15:57,675 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.12) internal successors, (128), 25 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2021-07-13 19:15:57,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:15:57,754 INFO L225 Difference]: With dead ends: 14431 [2021-07-13 19:15:57,754 INFO L226 Difference]: Without dead ends: 13585 [2021-07-13 19:15:57,755 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 135 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 10914.8ms TimeCoverageRelationStatistics Valid=456, Invalid=2405, Unknown=5, NotChecked=104, Total=2970 [2021-07-13 19:15:57,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13585 states. [2021-07-13 19:15:57,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13585 to 11412. [2021-07-13 19:15:57,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11412 states, 11410 states have (on average 2.774934268185802) internal successors, (31662), 11411 states have internal predecessors, (31662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:15:57,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11412 states to 11412 states and 31662 transitions. [2021-07-13 19:15:57,940 INFO L78 Accepts]: Start accepts. Automaton has 11412 states and 31662 transitions. Word has length 144 [2021-07-13 19:15:57,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:15:57,940 INFO L482 AbstractCegarLoop]: Abstraction has 11412 states and 31662 transitions. [2021-07-13 19:15:57,940 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 5.12) internal successors, (128), 25 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:15:57,940 INFO L276 IsEmpty]: Start isEmpty. Operand 11412 states and 31662 transitions. [2021-07-13 19:15:57,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-07-13 19:15:57,951 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:15:57,952 INFO L508 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:15:58,157 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2021-07-13 19:15:58,157 INFO L430 AbstractCegarLoop]: === Iteration 19 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:15:58,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:15:58,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1237782157, now seen corresponding path program 10 times [2021-07-13 19:15:58,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:15:58,158 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004670735] [2021-07-13 19:15:58,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:15:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:16:00,690 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 233 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-07-13 19:16:00,690 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:16:00,690 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004670735] [2021-07-13 19:16:00,690 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004670735] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:16:00,690 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708833979] [2021-07-13 19:16:00,690 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:16:00,814 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-07-13 19:16:00,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-13 19:16:00,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 31 conjunts are in the unsatisfiable core [2021-07-13 19:16:00,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:16:00,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-07-13 19:16:00,842 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:16:00,844 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:16:00,844 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:16:00,844 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-13 19:16:00,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-07-13 19:16:00,865 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:16:00,869 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:16:00,870 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:16:00,870 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-13 19:16:00,990 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-13 19:16:00,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-07-13 19:16:00,992 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:16:00,996 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:16:00,997 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:16:00,997 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-13 19:16:01,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-13 19:16:01,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-13 19:16:01,044 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:16:01,049 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:16:01,049 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:16:01,055 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:16:01,056 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:16:01,056 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-07-13 19:16:01,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-07-13 19:16:01,121 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:16:01,125 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:16:01,128 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:16:01,128 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2021-07-13 19:16:01,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-13 19:16:01,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-13 19:16:01,183 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:16:01,186 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:16:01,187 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:16:01,194 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:16:01,195 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:16:01,195 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:19 [2021-07-13 19:16:01,362 INFO L354 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2021-07-13 19:16:01,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2021-07-13 19:16:01,364 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:16:01,368 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:16:01,368 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:16:01,368 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:17 [2021-07-13 19:16:01,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 24 treesize of output 19 [2021-07-13 19:16:01,500 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:16:01,506 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:16:01,508 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-07-13 19:16:01,509 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2021-07-13 19:16:03,532 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post39| 1))) (not (= (* 28 c_t_funThread1of2ForFork0_~i~0) (* 28 t_funThread2of2ForFork0_~i~0))))) is different from true [2021-07-13 19:16:03,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 23 [2021-07-13 19:16:03,609 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:16:03,614 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:16:03,617 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-07-13 19:16:03,617 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:35, output treesize:28 [2021-07-13 19:16:04,644 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-13 19:16:04,644 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708833979] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:16:04,645 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:16:04,645 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 18] total 56 [2021-07-13 19:16:04,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044766594] [2021-07-13 19:16:04,645 INFO L462 AbstractCegarLoop]: Interpolant automaton has 56 states [2021-07-13 19:16:04,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:16:04,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-07-13 19:16:04,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=2649, Unknown=2, NotChecked=106, Total=3080 [2021-07-13 19:16:04,647 INFO L87 Difference]: Start difference. First operand 11412 states and 31662 transitions. Second operand has 56 states, 56 states have (on average 4.160714285714286) internal successors, (233), 56 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:16:09,596 WARN L205 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2021-07-13 19:18:42,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:18:42,763 INFO L93 Difference]: Finished difference Result 14306 states and 39342 transitions. [2021-07-13 19:18:42,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-07-13 19:18:42,774 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 4.160714285714286) internal successors, (233), 56 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2021-07-13 19:18:42,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:18:42,799 INFO L225 Difference]: With dead ends: 14306 [2021-07-13 19:18:42,799 INFO L226 Difference]: Without dead ends: 13370 [2021-07-13 19:18:42,802 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 132 SyntacticMatches, 4 SemanticMatches, 102 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2873 ImplicationChecksByTransitivity, 35905.1ms TimeCoverageRelationStatistics Valid=1153, Invalid=9336, Unknown=21, NotChecked=202, Total=10712 [2021-07-13 19:18:42,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13370 states. [2021-07-13 19:18:43,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13370 to 11412. [2021-07-13 19:18:43,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11412 states, 11410 states have (on average 2.7747589833479402) internal successors, (31660), 11411 states have internal predecessors, (31660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:18:43,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11412 states to 11412 states and 31660 transitions. [2021-07-13 19:18:43,050 INFO L78 Accepts]: Start accepts. Automaton has 11412 states and 31660 transitions. Word has length 144 [2021-07-13 19:18:43,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:18:43,051 INFO L482 AbstractCegarLoop]: Abstraction has 11412 states and 31660 transitions. [2021-07-13 19:18:43,051 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 56 states, 56 states have (on average 4.160714285714286) internal successors, (233), 56 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:18:43,051 INFO L276 IsEmpty]: Start isEmpty. Operand 11412 states and 31660 transitions. [2021-07-13 19:18:43,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-07-13 19:18:43,063 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:18:43,063 INFO L508 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:18:43,263 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:18:43,264 INFO L430 AbstractCegarLoop]: === Iteration 20 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:18:43,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:18:43,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1451804471, now seen corresponding path program 11 times [2021-07-13 19:18:43,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:18:43,264 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864086029] [2021-07-13 19:18:43,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:18:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:18:45,920 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 233 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-07-13 19:18:45,921 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:18:45,921 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864086029] [2021-07-13 19:18:45,921 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864086029] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:18:45,921 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304638819] [2021-07-13 19:18:45,921 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:18:46,041 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2021-07-13 19:18:46,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-13 19:18:46,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 31 conjunts are in the unsatisfiable core [2021-07-13 19:18:46,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:18:46,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-07-13 19:18:46,063 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:18:46,065 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:18:46,065 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:18:46,065 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-13 19:18:46,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-07-13 19:18:46,085 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:18:46,088 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:18:46,089 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:18:46,089 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-13 19:18:46,208 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-13 19:18:46,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-07-13 19:18:46,211 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:18:46,215 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:18:46,216 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:18:46,216 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-13 19:18:46,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-13 19:18:46,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-13 19:18:46,266 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:18:46,270 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:18:46,271 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:18:46,275 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:18:46,276 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:18:46,276 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-07-13 19:18:46,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-07-13 19:18:46,334 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:18:46,341 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:18:46,342 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:18:46,342 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2021-07-13 19:18:46,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-13 19:18:46,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-13 19:18:46,404 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:18:46,408 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:18:46,408 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:18:46,415 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:18:46,416 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:18:46,416 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:19 [2021-07-13 19:18:46,507 INFO L354 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2021-07-13 19:18:46,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2021-07-13 19:18:46,509 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:18:46,512 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:18:46,513 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:18:46,513 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2021-07-13 19:18:46,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 24 treesize of output 19 [2021-07-13 19:18:46,645 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:18:46,650 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:18:46,653 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-07-13 19:18:46,653 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:26 [2021-07-13 19:18:47,197 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post39| 1))) (not (= (* 28 t_funThread2of2ForFork0_~i~0) (+ (* 28 c_t_funThread1of2ForFork0_~i~0) 28))))) is different from true [2021-07-13 19:18:47,709 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (not (= (* 28 t_funThread2of2ForFork0_~i~0) (+ (* 28 |c_t_funThread1of2ForFork0_#t~post35|) 28))) (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post39| 1))))) is different from true [2021-07-13 19:18:49,733 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post39| 1))) (not (= (* 28 c_t_funThread1of2ForFork0_~i~0) (* 28 t_funThread2of2ForFork0_~i~0))))) is different from true [2021-07-13 19:18:49,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 23 [2021-07-13 19:18:49,798 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:18:49,803 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:18:49,806 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-07-13 19:18:49,806 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:35, output treesize:28 [2021-07-13 19:18:50,878 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-13 19:18:50,879 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304638819] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:18:50,879 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:18:50,879 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 18] total 58 [2021-07-13 19:18:50,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761806472] [2021-07-13 19:18:50,879 INFO L462 AbstractCegarLoop]: Interpolant automaton has 58 states [2021-07-13 19:18:50,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:18:50,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-07-13 19:18:50,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=2604, Unknown=4, NotChecked=324, Total=3306 [2021-07-13 19:18:50,881 INFO L87 Difference]: Start difference. First operand 11412 states and 31660 transitions. Second operand has 58 states, 58 states have (on average 4.017241379310345) internal successors, (233), 58 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:18:55,465 WARN L205 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 53 DAG size of output: 30 [2021-07-13 19:18:57,867 WARN L205 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2021-07-13 19:19:03,104 WARN L205 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2021-07-13 19:19:06,330 WARN L205 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2021-07-13 19:20:39,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:20:39,335 INFO L93 Difference]: Finished difference Result 13406 states and 37158 transitions. [2021-07-13 19:20:39,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-07-13 19:20:39,336 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 4.017241379310345) internal successors, (233), 58 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2021-07-13 19:20:39,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:20:39,376 INFO L225 Difference]: With dead ends: 13406 [2021-07-13 19:20:39,376 INFO L226 Difference]: Without dead ends: 13186 [2021-07-13 19:20:39,378 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 105 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3468 ImplicationChecksByTransitivity, 72091.0ms TimeCoverageRelationStatistics Valid=1526, Invalid=9157, Unknown=41, NotChecked=618, Total=11342 [2021-07-13 19:20:39,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13186 states. [2021-07-13 19:20:39,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13186 to 11830. [2021-07-13 19:20:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11830 states, 11828 states have (on average 2.779506256340886) internal successors, (32876), 11829 states have internal predecessors, (32876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:20:39,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11830 states to 11830 states and 32876 transitions. [2021-07-13 19:20:39,615 INFO L78 Accepts]: Start accepts. Automaton has 11830 states and 32876 transitions. Word has length 144 [2021-07-13 19:20:39,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:20:39,616 INFO L482 AbstractCegarLoop]: Abstraction has 11830 states and 32876 transitions. [2021-07-13 19:20:39,616 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 58 states, 58 states have (on average 4.017241379310345) internal successors, (233), 58 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:20:39,616 INFO L276 IsEmpty]: Start isEmpty. Operand 11830 states and 32876 transitions. [2021-07-13 19:20:39,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-07-13 19:20:39,628 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:20:39,628 INFO L508 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:20:39,829 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:20:39,829 INFO L430 AbstractCegarLoop]: === Iteration 21 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:20:39,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:20:39,829 INFO L82 PathProgramCache]: Analyzing trace with hash 561925277, now seen corresponding path program 12 times [2021-07-13 19:20:39,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:20:39,829 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301827640] [2021-07-13 19:20:39,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:20:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:20:40,890 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 26 [2021-07-13 19:20:42,542 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 233 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-07-13 19:20:42,542 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:20:42,542 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301827640] [2021-07-13 19:20:42,542 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301827640] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:20:42,542 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052565347] [2021-07-13 19:20:42,542 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:20:42,638 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-07-13 19:20:42,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-13 19:20:42,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 31 conjunts are in the unsatisfiable core [2021-07-13 19:20:42,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:20:42,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-07-13 19:20:42,664 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:20:42,666 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:20:42,666 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:20:42,666 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-13 19:20:42,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-07-13 19:20:42,689 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:20:42,692 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:20:42,693 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:20:42,693 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-13 19:20:42,805 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-13 19:20:42,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-07-13 19:20:42,807 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:20:42,810 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:20:42,811 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:20:42,811 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-13 19:20:42,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-13 19:20:42,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-13 19:20:42,856 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:20:42,860 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:20:42,860 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:20:42,865 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:20:42,866 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:20:42,866 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-07-13 19:20:42,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-07-13 19:20:42,927 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:20:42,933 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:20:42,933 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:20:42,933 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2021-07-13 19:20:43,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-13 19:20:43,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-13 19:20:43,015 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:20:43,019 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:20:43,019 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:20:43,026 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:20:43,027 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:20:43,027 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:19 [2021-07-13 19:20:43,123 INFO L354 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2021-07-13 19:20:43,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2021-07-13 19:20:43,124 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:20:43,128 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:20:43,128 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:20:43,128 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2021-07-13 19:20:43,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 24 treesize of output 19 [2021-07-13 19:20:43,320 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:20:43,326 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:20:43,328 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-07-13 19:20:43,328 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:26 [2021-07-13 19:20:43,829 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (not (= (* 28 t_funThread2of2ForFork0_~i~0) (+ (* 28 |c_t_funThread1of2ForFork0_#t~post35|) 28))) (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post39| 1))))) is different from true [2021-07-13 19:20:45,871 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post39| 1))) (not (= (* 28 c_t_funThread1of2ForFork0_~i~0) (* 28 t_funThread2of2ForFork0_~i~0))))) is different from true [2021-07-13 19:20:45,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 23 [2021-07-13 19:20:45,935 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:20:45,940 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:20:45,942 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-07-13 19:20:45,942 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:35, output treesize:28 [2021-07-13 19:20:46,980 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-13 19:20:46,980 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052565347] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:20:46,980 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:20:46,980 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 18] total 58 [2021-07-13 19:20:46,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963684956] [2021-07-13 19:20:46,981 INFO L462 AbstractCegarLoop]: Interpolant automaton has 58 states [2021-07-13 19:20:46,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:20:46,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-07-13 19:20:46,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=2736, Unknown=3, NotChecked=218, Total=3306 [2021-07-13 19:20:46,982 INFO L87 Difference]: Start difference. First operand 11830 states and 32876 transitions. Second operand has 58 states, 58 states have (on average 4.017241379310345) internal successors, (233), 58 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:20:52,360 WARN L205 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 53 DAG size of output: 30 [2021-07-13 19:20:57,700 WARN L205 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2021-07-13 19:21:00,053 WARN L205 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2021-07-13 19:23:09,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:23:09,948 INFO L93 Difference]: Finished difference Result 13801 states and 38198 transitions. [2021-07-13 19:23:09,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2021-07-13 19:23:09,958 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 4.017241379310345) internal successors, (233), 58 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2021-07-13 19:23:09,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:23:09,980 INFO L225 Difference]: With dead ends: 13801 [2021-07-13 19:23:09,981 INFO L226 Difference]: Without dead ends: 13581 [2021-07-13 19:23:09,982 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 111 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3766 ImplicationChecksByTransitivity, 71649.8ms TimeCoverageRelationStatistics Valid=1662, Invalid=10513, Unknown=43, NotChecked=438, Total=12656 [2021-07-13 19:23:10,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13581 states. [2021-07-13 19:23:10,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13581 to 12490. [2021-07-13 19:23:10,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12490 states, 12488 states have (on average 2.7775464445868034) internal successors, (34686), 12489 states have internal predecessors, (34686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:23:10,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12490 states to 12490 states and 34686 transitions. [2021-07-13 19:23:10,224 INFO L78 Accepts]: Start accepts. Automaton has 12490 states and 34686 transitions. Word has length 144 [2021-07-13 19:23:10,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:23:10,224 INFO L482 AbstractCegarLoop]: Abstraction has 12490 states and 34686 transitions. [2021-07-13 19:23:10,224 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 58 states, 58 states have (on average 4.017241379310345) internal successors, (233), 58 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:23:10,225 INFO L276 IsEmpty]: Start isEmpty. Operand 12490 states and 34686 transitions. [2021-07-13 19:23:10,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-07-13 19:23:10,237 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:23:10,237 INFO L508 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:23:10,437 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2021-07-13 19:23:10,438 INFO L430 AbstractCegarLoop]: === Iteration 22 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:23:10,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:23:10,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1272475267, now seen corresponding path program 13 times [2021-07-13 19:23:10,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:23:10,438 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163987481] [2021-07-13 19:23:10,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:23:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:23:12,784 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 233 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-07-13 19:23:12,784 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:23:12,784 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163987481] [2021-07-13 19:23:12,784 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163987481] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:23:12,784 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351243548] [2021-07-13 19:23:12,784 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:23:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:23:12,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 31 conjunts are in the unsatisfiable core [2021-07-13 19:23:12,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:23:12,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-07-13 19:23:12,910 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:23:12,912 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:23:12,913 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:23:12,913 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-13 19:23:12,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-07-13 19:23:12,937 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:23:12,941 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:23:12,942 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:23:12,942 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-13 19:23:13,068 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-13 19:23:13,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-07-13 19:23:13,071 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:23:13,075 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:23:13,076 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:23:13,076 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-13 19:23:13,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-13 19:23:13,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-13 19:23:13,133 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:23:13,138 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:23:13,139 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:23:13,145 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:23:13,146 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:23:13,146 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-07-13 19:23:13,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-07-13 19:23:13,217 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:23:13,223 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:23:13,224 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:23:13,224 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2021-07-13 19:23:13,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-13 19:23:13,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-13 19:23:13,291 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:23:13,296 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:23:13,296 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:23:13,303 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:23:13,304 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:23:13,304 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:19 [2021-07-13 19:23:13,393 INFO L354 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2021-07-13 19:23:13,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2021-07-13 19:23:13,395 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:23:13,398 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:23:13,399 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:23:13,399 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2021-07-13 19:23:13,559 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 24 treesize of output 19 [2021-07-13 19:23:13,560 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:23:13,564 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:23:13,566 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-07-13 19:23:13,566 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:26 [2021-07-13 19:23:14,077 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (not (= (* 28 t_funThread2of2ForFork0_~i~0) (+ (* 28 |c_t_funThread1of2ForFork0_#t~post35|) 28))) (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post39| 1))))) is different from true [2021-07-13 19:23:16,110 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post39| 1))) (not (= (* 28 c_t_funThread1of2ForFork0_~i~0) (* 28 t_funThread2of2ForFork0_~i~0))))) is different from true [2021-07-13 19:23:16,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 23 [2021-07-13 19:23:16,252 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:23:16,257 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:23:16,259 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-07-13 19:23:16,259 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:35, output treesize:28 [2021-07-13 19:23:17,294 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-13 19:23:17,294 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351243548] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:23:17,294 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:23:17,294 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 18] total 58 [2021-07-13 19:23:17,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874645085] [2021-07-13 19:23:17,295 INFO L462 AbstractCegarLoop]: Interpolant automaton has 58 states [2021-07-13 19:23:17,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:23:17,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-07-13 19:23:17,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=2718, Unknown=3, NotChecked=218, Total=3306 [2021-07-13 19:23:17,296 INFO L87 Difference]: Start difference. First operand 12490 states and 34686 transitions. Second operand has 58 states, 58 states have (on average 4.017241379310345) internal successors, (233), 58 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 19:23:22,221 WARN L205 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 53 DAG size of output: 30 [2021-07-13 19:23:27,691 WARN L205 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2021-07-13 19:23:30,426 WARN L205 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 58 DAG size of output: 35 Received shutdown request... [2021-07-13 19:23:41,779 WARN L222 SmtUtils]: Removed 1 from assertion stack [2021-07-13 19:23:41,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-07-13 19:23:41,980 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2021-07-13 19:23:41,980 WARN L547 AbstractCegarLoop]: Verification canceled [2021-07-13 19:23:41,980 INFO L301 ceAbstractionStarter]: Result for error location t_funThread1of2ForFork0 was TIMEOUT (1/3) [2021-07-13 19:23:41,981 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-07-13 19:23:41,981 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-13 19:23:41,981 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-13 19:23:41,981 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-13 19:23:41,981 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-13 19:23:41,981 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-13 19:23:41,981 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-13 19:23:41,981 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-13 19:23:41,981 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-13 19:23:41,983 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 217 places, 257 transitions, 532 flow [2021-07-13 19:23:41,983 WARN L547 AbstractCegarLoop]: Verification canceled [2021-07-13 19:23:41,983 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was TIMEOUT (2/3) [2021-07-13 19:23:41,984 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-13 19:23:41,984 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-13 19:23:41,984 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-13 19:23:41,984 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-13 19:23:41,984 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-13 19:23:41,984 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-13 19:23:41,984 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-13 19:23:41,984 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-13 19:23:41,984 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == t_funThread2of2ForFork0======== [2021-07-13 19:23:41,985 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 217 places, 257 transitions, 532 flow [2021-07-13 19:23:41,986 WARN L547 AbstractCegarLoop]: Verification canceled [2021-07-13 19:23:41,986 INFO L301 ceAbstractionStarter]: Result for error location t_funThread2of2ForFork0 was TIMEOUT (3/3) [2021-07-13 19:23:41,986 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2021-07-13 19:23:41,988 WARN L196 ceAbstractionStarter]: Timeout [2021-07-13 19:23:41,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 07:23:41 BasicIcfg [2021-07-13 19:23:41,989 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-13 19:23:41,989 INFO L168 Benchmark]: Toolchain (without parser) took 837534.89 ms. Allocated memory was 207.6 MB in the beginning and 7.8 GB in the end (delta: 7.6 GB). Free memory was 170.6 MB in the beginning and 3.2 GB in the end (delta: -3.1 GB). Peak memory consumption was 4.6 GB. Max. memory is 8.0 GB. [2021-07-13 19:23:41,989 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 207.6 MB. Free memory is still 189.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-07-13 19:23:41,990 INFO L168 Benchmark]: CACSL2BoogieTranslator took 522.69 ms. Allocated memory is still 207.6 MB. Free memory was 170.4 MB in the beginning and 171.9 MB in the end (delta: -1.5 MB). Peak memory consumption was 14.0 MB. Max. memory is 8.0 GB. [2021-07-13 19:23:41,990 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.40 ms. Allocated memory is still 207.6 MB. Free memory was 171.9 MB in the beginning and 169.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-07-13 19:23:41,990 INFO L168 Benchmark]: Boogie Preprocessor took 27.35 ms. Allocated memory is still 207.6 MB. Free memory was 169.3 MB in the beginning and 167.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-07-13 19:23:41,990 INFO L168 Benchmark]: RCFGBuilder took 561.14 ms. Allocated memory is still 207.6 MB. Free memory was 167.2 MB in the beginning and 130.5 MB in the end (delta: 36.7 MB). Peak memory consumption was 36.7 MB. Max. memory is 8.0 GB. [2021-07-13 19:23:41,990 INFO L168 Benchmark]: TraceAbstraction took 836370.61 ms. Allocated memory was 207.6 MB in the beginning and 7.8 GB in the end (delta: 7.6 GB). Free memory was 130.0 MB in the beginning and 3.2 GB in the end (delta: -3.1 GB). Peak memory consumption was 4.5 GB. Max. memory is 8.0 GB. [2021-07-13 19:23:41,990 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.14 ms. Allocated memory is still 207.6 MB. Free memory is still 189.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 522.69 ms. Allocated memory is still 207.6 MB. Free memory was 170.4 MB in the beginning and 171.9 MB in the end (delta: -1.5 MB). Peak memory consumption was 14.0 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 43.40 ms. Allocated memory is still 207.6 MB. Free memory was 171.9 MB in the beginning and 169.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 27.35 ms. Allocated memory is still 207.6 MB. Free memory was 169.3 MB in the beginning and 167.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 561.14 ms. Allocated memory is still 207.6 MB. Free memory was 167.2 MB in the beginning and 130.5 MB in the end (delta: 36.7 MB). Peak memory consumption was 36.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 836370.61 ms. Allocated memory was 207.6 MB in the beginning and 7.8 GB in the end (delta: 7.6 GB). Free memory was 130.0 MB in the beginning and 3.2 GB in the end (delta: -3.1 GB). Peak memory consumption was 4.5 GB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 922]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (12490states) and FLOYD_HOARE automaton (currently 64 states, 58 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 21 for 0ms.. - TimeoutResultAtElement [Line: 922]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing initial abstraction,while PetriNet2FiniteAutomaton was constructing automaton for Petri net that has has 217 places, 257 transitions, 532 flow. Already constructed 2 states. Currently 1 states in worklist.. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t_funThread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 213 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3632.3ms, OverallIterations: 5, TraceHistogramMax: 2, EmptinessCheckTime: 42.6ms, AutomataDifference: 761.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 111.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 714 SDtfs, 592 SDslu, 1481 SDs, 0 SdLazy, 324 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 214.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 255 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 425.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2220occurred in iteration=0, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 337.1ms AutomataMinimizationTime, 5 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 76.5ms SsaConstructionTime, 199.8ms SatisfiabilityAnalysisTime, 1082.9ms InterpolantComputationTime, 548 NumberOfCodeBlocks, 538 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 540 ConstructedInterpolants, 1 QuantifiedInterpolants, 1049 SizeOfPredicates, 16 NumberOfNonLiveVariables, 483 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 15/32 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t_funThread1of1ForFork0 with 2 thread instances CFG has 4 procedures, 270 locations, 5 error locations. Started 0 CEGAR loops. No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 3 procedures, 213 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7600.1ms, OverallIterations: 13, TraceHistogramMax: 10, EmptinessCheckTime: 15.2ms, AutomataDifference: 1574.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 45.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1353 SDtfs, 292 SDslu, 4343 SDs, 0 SdLazy, 510 SolverSat, 109 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 320.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 866 GetRequests, 654 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1113 ImplicationChecksByTransitivity, 1692.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2985occurred in iteration=0, InterpolantAutomatonStates: 170, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 392.0ms AutomataMinimizationTime, 12 MinimizatonAttempts, 27 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 141.9ms SsaConstructionTime, 438.4ms SatisfiabilityAnalysisTime, 2195.6ms InterpolantComputationTime, 1495 NumberOfCodeBlocks, 1481 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 1380 ConstructedInterpolants, 0 QuantifiedInterpolants, 2332 SizeOfPredicates, 90 NumberOfNonLiveVariables, 1348 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 22 InterpolantComputations, 3 PerfectInterpolantSequences, 91/1382 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 2 thread instances CFG has 4 procedures, 270 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 2.2ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t_funThread1of2ForFork0 with 1 thread instances CFG has 4 procedures, 270 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 824961.4ms, OverallIterations: 22, TraceHistogramMax: 10, EmptinessCheckTime: 826.2ms, AutomataDifference: 734488.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 4668.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 5984 SDtfs, 12171 SDslu, 81918 SDs, 0 SdLazy, 25402 SolverSat, 957 SolverUnsat, 202 SolverUnknown, 0 SolverNotchecked, 416745.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3369 GetRequests, 2329 SyntacticMatches, 36 SemanticMatches, 1003 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 20490 ImplicationChecksByTransitivity, 331576.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=193105occurred in iteration=0, InterpolantAutomatonStates: 604, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 31823.4ms AutomataMinimizationTime, 21 MinimizatonAttempts, 17014 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 685.0ms SsaConstructionTime, 1265.5ms SatisfiabilityAnalysisTime, 45896.2ms InterpolantComputationTime, 5016 NumberOfCodeBlocks, 4803 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 4974 ConstructedInterpolants, 105 QuantifiedInterpolants, 47537 SizeOfPredicates, 298 NumberOfNonLiveVariables, 4625 ConjunctsInSsa, 406 ConjunctsInUnsatCore, 42 InterpolantComputations, 4 PerfectInterpolantSequences, 3706/5754 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t_funThread2of2ForFork0 with 1 thread instances CFG has 4 procedures, 270 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 1.8ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown