/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 04:16:33,958 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 04:16:33,961 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 04:16:33,997 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 04:16:33,997 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 04:16:33,999 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 04:16:34,001 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 04:16:34,003 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 04:16:34,015 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 04:16:34,016 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 04:16:34,018 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 04:16:34,019 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 04:16:34,020 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 04:16:34,021 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 04:16:34,026 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 04:16:34,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 04:16:34,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 04:16:34,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 04:16:34,044 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 04:16:34,050 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 04:16:34,055 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 04:16:34,056 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 04:16:34,058 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 04:16:34,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 04:16:34,065 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 04:16:34,065 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 04:16:34,065 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 04:16:34,066 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 04:16:34,071 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 04:16:34,072 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 04:16:34,073 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 04:16:34,074 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 04:16:34,075 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 04:16:34,079 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 04:16:34,080 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 04:16:34,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 04:16:34,081 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 04:16:34,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 04:16:34,085 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 04:16:34,089 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 04:16:34,090 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 04:16:34,091 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-07 04:16:34,134 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 04:16:34,134 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 04:16:34,139 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 04:16:34,139 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 04:16:34,139 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 04:16:34,139 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 04:16:34,140 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 04:16:34,140 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 04:16:34,140 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 04:16:34,140 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 04:16:34,141 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 04:16:34,141 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 04:16:34,142 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 04:16:34,142 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 04:16:34,142 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 04:16:34,142 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 04:16:34,142 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 04:16:34,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 04:16:34,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 04:16:34,143 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 04:16:34,143 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 04:16:34,143 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 04:16:34,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 04:16:34,144 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 04:16:34,144 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 04:16:34,144 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-bitabs/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-01-07 04:16:34,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 04:16:34,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 04:16:34,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 04:16:34,585 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 04:16:34,586 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 04:16:34,587 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i [2021-01-07 04:16:34,670 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/96a845e2a/f02785999cb342c99cf3e431658aa4dc/FLAG585265c5d [2021-01-07 04:16:35,431 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 04:16:35,432 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i [2021-01-07 04:16:35,468 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/96a845e2a/f02785999cb342c99cf3e431658aa4dc/FLAG585265c5d [2021-01-07 04:16:35,623 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/96a845e2a/f02785999cb342c99cf3e431658aa4dc [2021-01-07 04:16:35,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 04:16:35,629 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 04:16:35,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 04:16:35,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 04:16:35,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 04:16:35,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 04:16:35" (1/1) ... [2021-01-07 04:16:35,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bab0fb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:16:35, skipping insertion in model container [2021-01-07 04:16:35,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 04:16:35" (1/1) ... [2021-01-07 04:16:35,654 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 04:16:35,740 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-07 04:16:36,396 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i[44118,44131] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~alt_malloc_sizes~0,GLOBAL],[IdentifierExpression[#t~post33,]]] [2021-01-07 04:16:36,419 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i[44660,44673] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],StructAccessExpression[IdentifierExpression[~user~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem70,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem70,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem71,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem71,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem72,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem72,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem73,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem73,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem74,],base],StructAccessExpression[IdentifierExpression[#t~mem74,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem76,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem76,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem88,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem88,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem89,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem89,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem101,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem101,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~0,],base],StructAccessExpression[IdentifierExpression[~_ha_head~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_new_buckets~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem112,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem112,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem122,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem122,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem148,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem148,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem158,],base],StructAccessExpression[IdentifierExpression[#t~mem158,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem159,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem159,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem169,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem224,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem224,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem229,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem229,],offset],IdentifierExpression[#t~mem231,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem235,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem235,],offset],IdentifierExpression[#t~mem237,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~0,],base],StructAccessExpression[IdentifierExpression[~_hd_head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem249,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem249,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem252,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem252,],offset]]]] [2021-01-07 04:16:36,579 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i[56247,56260] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] [2021-01-07 04:16:36,580 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i[56368,56381] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem272,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem272,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem277,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem277,],offset],IdentifierExpression[#t~mem279,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem283,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem283,],offset],IdentifierExpression[#t~mem285,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~1,],base],StructAccessExpression[IdentifierExpression[~_hd_head~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem297,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem297,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem300,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem300,],offset]]]] [2021-01-07 04:16:36,601 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 04:16:36,611 INFO L203 MainTranslator]: Completed pre-run [2021-01-07 04:16:36,681 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i[44118,44131] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#alt_malloc_sizes~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#alt_malloc_sizes~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[#t~post33,]]]]] [2021-01-07 04:16:36,684 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i[44660,44673] left hand side expression in assignment: address: IdentifierExpression[~#i~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],StructAccessExpression[IdentifierExpression[~user~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem76,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem76,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem77,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem77,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem78,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem78,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem79,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem79,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem80,],base],StructAccessExpression[IdentifierExpression[#t~mem80,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem82,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem82,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem94,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem94,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem95,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem95,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem107,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem107,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~0,],base],StructAccessExpression[IdentifierExpression[~_ha_head~0,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~#_he_new_buckets~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem120,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem120,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem130,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem130,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem157,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem157,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem167,],base],StructAccessExpression[IdentifierExpression[#t~mem167,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem169,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem179,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem179,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~#i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem236,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem236,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem241,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem241,],offset],IdentifierExpression[#t~mem243,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem247,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem247,],offset],IdentifierExpression[#t~mem249,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~0,],base],StructAccessExpression[IdentifierExpression[~_hd_head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem261,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem261,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem264,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem264,],offset]]]] [2021-01-07 04:16:36,783 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i[56247,56260] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] [2021-01-07 04:16:36,784 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i[56368,56381] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem284,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem284,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem289,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem289,],offset],IdentifierExpression[#t~mem291,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem295,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem295,],offset],IdentifierExpression[#t~mem297,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~1,],base],StructAccessExpression[IdentifierExpression[~_hd_head~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem309,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem309,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem312,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem312,],offset]]]] [2021-01-07 04:16:36,816 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 04:16:37,047 INFO L208 MainTranslator]: Completed translation [2021-01-07 04:16:37,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:16:37 WrapperNode [2021-01-07 04:16:37,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 04:16:37,049 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 04:16:37,049 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 04:16:37,050 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 04:16:37,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:16:37" (1/1) ... [2021-01-07 04:16:37,133 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:16:37" (1/1) ... [2021-01-07 04:16:37,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 04:16:37,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 04:16:37,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 04:16:37,268 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 04:16:37,279 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:16:37" (1/1) ... [2021-01-07 04:16:37,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:16:37" (1/1) ... [2021-01-07 04:16:37,299 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:16:37" (1/1) ... [2021-01-07 04:16:37,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:16:37" (1/1) ... [2021-01-07 04:16:37,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:16:37" (1/1) ... [2021-01-07 04:16:37,429 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:16:37" (1/1) ... [2021-01-07 04:16:37,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:16:37" (1/1) ... [2021-01-07 04:16:37,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 04:16:37,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 04:16:37,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 04:16:37,457 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 04:16:37,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:16:37" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/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-01-07 04:16:37,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 04:16:37,556 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-01-07 04:16:37,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 04:16:37,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 04:16:37,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 04:16:37,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 04:16:37,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 04:16:37,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 04:16:37,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 04:16:37,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 04:16:37,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 04:16:39,983 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 04:16:39,984 INFO L299 CfgBuilder]: Removed 124 assume(true) statements. [2021-01-07 04:16:39,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 04:16:39 BoogieIcfgContainer [2021-01-07 04:16:39,988 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 04:16:39,990 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 04:16:39,990 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 04:16:39,993 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 04:16:39,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 04:16:35" (1/3) ... [2021-01-07 04:16:39,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@219d1255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 04:16:39, skipping insertion in model container [2021-01-07 04:16:39,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:16:37" (2/3) ... [2021-01-07 04:16:39,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@219d1255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 04:16:39, skipping insertion in model container [2021-01-07 04:16:39,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 04:16:39" (3/3) ... [2021-01-07 04:16:39,998 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test6-2.i [2021-01-07 04:16:40,004 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 04:16:40,010 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2021-01-07 04:16:40,029 INFO L253 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2021-01-07 04:16:40,072 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 04:16:40,072 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 04:16:40,072 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 04:16:40,072 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 04:16:40,072 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 04:16:40,073 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 04:16:40,073 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 04:16:40,073 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 04:16:40,110 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states. [2021-01-07 04:16:40,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-01-07 04:16:40,115 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:16:40,116 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:16:40,116 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:16:40,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:16:40,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1030621672, now seen corresponding path program 1 times [2021-01-07 04:16:40,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:16:40,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929864109] [2021-01-07 04:16:40,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:16:40,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:16:40,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:16:40,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929864109] [2021-01-07 04:16:40,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:16:40,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 04:16:40,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121194640] [2021-01-07 04:16:40,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-07 04:16:40,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:16:40,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-07 04:16:40,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 04:16:40,335 INFO L87 Difference]: Start difference. First operand 276 states. Second operand 2 states. [2021-01-07 04:16:40,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:16:40,411 INFO L93 Difference]: Finished difference Result 544 states and 861 transitions. [2021-01-07 04:16:40,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-07 04:16:40,412 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2021-01-07 04:16:40,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:16:40,436 INFO L225 Difference]: With dead ends: 544 [2021-01-07 04:16:40,437 INFO L226 Difference]: Without dead ends: 266 [2021-01-07 04:16:40,448 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 04:16:40,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-01-07 04:16:40,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2021-01-07 04:16:40,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2021-01-07 04:16:40,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 335 transitions. [2021-01-07 04:16:40,523 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 335 transitions. Word has length 8 [2021-01-07 04:16:40,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:16:40,523 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 335 transitions. [2021-01-07 04:16:40,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-07 04:16:40,524 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 335 transitions. [2021-01-07 04:16:40,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-07 04:16:40,524 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:16:40,524 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:16:40,525 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 04:16:40,525 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:16:40,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:16:40,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1260005844, now seen corresponding path program 1 times [2021-01-07 04:16:40,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:16:40,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143752491] [2021-01-07 04:16:40,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:16:40,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:16:40,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:16:40,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143752491] [2021-01-07 04:16:40,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:16:40,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:16:40,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082156099] [2021-01-07 04:16:40,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:16:40,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:16:40,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:16:40,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:16:40,626 INFO L87 Difference]: Start difference. First operand 266 states and 335 transitions. Second operand 4 states. [2021-01-07 04:16:41,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:16:41,301 INFO L93 Difference]: Finished difference Result 589 states and 741 transitions. [2021-01-07 04:16:41,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:16:41,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2021-01-07 04:16:41,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:16:41,305 INFO L225 Difference]: With dead ends: 589 [2021-01-07 04:16:41,305 INFO L226 Difference]: Without dead ends: 440 [2021-01-07 04:16:41,306 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:16:41,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-01-07 04:16:41,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 268. [2021-01-07 04:16:41,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2021-01-07 04:16:41,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 337 transitions. [2021-01-07 04:16:41,327 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 337 transitions. Word has length 10 [2021-01-07 04:16:41,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:16:41,327 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 337 transitions. [2021-01-07 04:16:41,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:16:41,327 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 337 transitions. [2021-01-07 04:16:41,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 04:16:41,329 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:16:41,329 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-07 04:16:41,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 04:16:41,330 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:16:41,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:16:41,330 INFO L82 PathProgramCache]: Analyzing trace with hash -602340381, now seen corresponding path program 1 times [2021-01-07 04:16:41,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:16:41,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200650878] [2021-01-07 04:16:41,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:16:41,360 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:16:41,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [301630160] [2021-01-07 04:16:41,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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-01-07 04:16:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:16:41,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:16:41,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:16:41,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:16:41,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200650878] [2021-01-07 04:16:41,831 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:16:41,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301630160] [2021-01-07 04:16:41,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:16:41,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:16:41,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425166677] [2021-01-07 04:16:41,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:16:41,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:16:41,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:16:41,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:16:41,859 INFO L87 Difference]: Start difference. First operand 268 states and 337 transitions. Second operand 3 states. [2021-01-07 04:16:42,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:16:42,005 INFO L93 Difference]: Finished difference Result 553 states and 701 transitions. [2021-01-07 04:16:42,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:16:42,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2021-01-07 04:16:42,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:16:42,009 INFO L225 Difference]: With dead ends: 553 [2021-01-07 04:16:42,009 INFO L226 Difference]: Without dead ends: 289 [2021-01-07 04:16:42,010 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:16:42,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-01-07 04:16:42,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 288. [2021-01-07 04:16:42,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2021-01-07 04:16:42,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 357 transitions. [2021-01-07 04:16:42,033 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 357 transitions. Word has length 44 [2021-01-07 04:16:42,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:16:42,034 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 357 transitions. [2021-01-07 04:16:42,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:16:42,034 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 357 transitions. [2021-01-07 04:16:42,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 04:16:42,039 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:16:42,039 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-07 04:16:42,253 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-01-07 04:16:42,254 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:16:42,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:16:42,256 INFO L82 PathProgramCache]: Analyzing trace with hash -821195099, now seen corresponding path program 1 times [2021-01-07 04:16:42,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:16:42,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635790100] [2021-01-07 04:16:42,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:16:42,307 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:16:42,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [124498884] [2021-01-07 04:16:42,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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-01-07 04:16:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:16:42,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:16:42,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:16:42,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:16:42,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635790100] [2021-01-07 04:16:42,598 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:16:42,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124498884] [2021-01-07 04:16:42,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:16:42,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:16:42,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216329357] [2021-01-07 04:16:42,599 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:16:42,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:16:42,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:16:42,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:16:42,602 INFO L87 Difference]: Start difference. First operand 288 states and 357 transitions. Second operand 4 states. [2021-01-07 04:16:42,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:16:42,695 INFO L93 Difference]: Finished difference Result 565 states and 703 transitions. [2021-01-07 04:16:42,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:16:42,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2021-01-07 04:16:42,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:16:42,697 INFO L225 Difference]: With dead ends: 565 [2021-01-07 04:16:42,698 INFO L226 Difference]: Without dead ends: 281 [2021-01-07 04:16:42,699 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:16:42,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-01-07 04:16:42,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 274. [2021-01-07 04:16:42,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2021-01-07 04:16:42,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 336 transitions. [2021-01-07 04:16:42,724 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 336 transitions. Word has length 44 [2021-01-07 04:16:42,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:16:42,725 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 336 transitions. [2021-01-07 04:16:42,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:16:42,725 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 336 transitions. [2021-01-07 04:16:42,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 04:16:42,728 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:16:42,728 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-07 04:16:42,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:16:42,935 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:16:42,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:16:42,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1704043945, now seen corresponding path program 1 times [2021-01-07 04:16:42,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:16:42,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723467768] [2021-01-07 04:16:42,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:16:42,958 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:16:42,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [836230736] [2021-01-07 04:16:42,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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-01-07 04:16:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:16:43,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 19 conjunts are in the unsatisfiable core [2021-01-07 04:16:43,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:16:43,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:16:43,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723467768] [2021-01-07 04:16:43,313 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:16:43,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836230736] [2021-01-07 04:16:43,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:16:43,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 04:16:43,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772114686] [2021-01-07 04:16:43,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 04:16:43,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:16:43,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 04:16:43,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 04:16:43,316 INFO L87 Difference]: Start difference. First operand 274 states and 336 transitions. Second operand 6 states. [2021-01-07 04:16:44,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:16:44,111 INFO L93 Difference]: Finished difference Result 486 states and 600 transitions. [2021-01-07 04:16:44,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 04:16:44,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2021-01-07 04:16:44,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:16:44,115 INFO L225 Difference]: With dead ends: 486 [2021-01-07 04:16:44,115 INFO L226 Difference]: Without dead ends: 484 [2021-01-07 04:16:44,116 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-01-07 04:16:44,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2021-01-07 04:16:44,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 272. [2021-01-07 04:16:44,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2021-01-07 04:16:44,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 334 transitions. [2021-01-07 04:16:44,129 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 334 transitions. Word has length 44 [2021-01-07 04:16:44,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:16:44,130 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 334 transitions. [2021-01-07 04:16:44,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 04:16:44,130 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 334 transitions. [2021-01-07 04:16:44,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-07 04:16:44,131 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:16:44,131 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-07 04:16:44,344 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:16:44,345 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:16:44,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:16:44,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1088553020, now seen corresponding path program 1 times [2021-01-07 04:16:44,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:16:44,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439354766] [2021-01-07 04:16:44,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:16:44,379 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:16:44,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1206031594] [2021-01-07 04:16:44,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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-01-07 04:16:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:16:44,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 04:16:44,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:16:44,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:16:44,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439354766] [2021-01-07 04:16:44,705 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:16:44,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206031594] [2021-01-07 04:16:44,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:16:44,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:16:44,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036258942] [2021-01-07 04:16:44,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 04:16:44,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:16:44,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 04:16:44,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:16:44,712 INFO L87 Difference]: Start difference. First operand 272 states and 334 transitions. Second operand 5 states. [2021-01-07 04:16:44,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:16:44,860 INFO L93 Difference]: Finished difference Result 1120 states and 1390 transitions. [2021-01-07 04:16:44,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 04:16:44,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2021-01-07 04:16:44,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:16:44,865 INFO L225 Difference]: With dead ends: 1120 [2021-01-07 04:16:44,865 INFO L226 Difference]: Without dead ends: 852 [2021-01-07 04:16:44,866 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:16:44,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2021-01-07 04:16:44,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 364. [2021-01-07 04:16:44,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2021-01-07 04:16:44,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 445 transitions. [2021-01-07 04:16:44,887 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 445 transitions. Word has length 51 [2021-01-07 04:16:44,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:16:44,887 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 445 transitions. [2021-01-07 04:16:44,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 04:16:44,888 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 445 transitions. [2021-01-07 04:16:44,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-07 04:16:44,889 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:16:44,889 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-07 04:16:45,104 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:16:45,105 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:16:45,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:16:45,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1193587178, now seen corresponding path program 1 times [2021-01-07 04:16:45,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:16:45,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376177395] [2021-01-07 04:16:45,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:16:45,137 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:16:45,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1043937250] [2021-01-07 04:16:45,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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-01-07 04:16:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:16:45,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 04:16:45,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:16:45,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:16:45,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376177395] [2021-01-07 04:16:45,501 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:16:45,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043937250] [2021-01-07 04:16:45,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:16:45,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:16:45,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829674626] [2021-01-07 04:16:45,502 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:16:45,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:16:45,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:16:45,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:16:45,503 INFO L87 Difference]: Start difference. First operand 364 states and 445 transitions. Second operand 3 states. [2021-01-07 04:16:45,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:16:45,716 INFO L93 Difference]: Finished difference Result 802 states and 981 transitions. [2021-01-07 04:16:45,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:16:45,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2021-01-07 04:16:45,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:16:45,720 INFO L225 Difference]: With dead ends: 802 [2021-01-07 04:16:45,720 INFO L226 Difference]: Without dead ends: 442 [2021-01-07 04:16:45,721 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:16:45,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2021-01-07 04:16:45,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 385. [2021-01-07 04:16:45,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2021-01-07 04:16:45,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 476 transitions. [2021-01-07 04:16:45,740 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 476 transitions. Word has length 54 [2021-01-07 04:16:45,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:16:45,740 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 476 transitions. [2021-01-07 04:16:45,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:16:45,741 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 476 transitions. [2021-01-07 04:16:45,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-07 04:16:45,742 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:16:45,742 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-07 04:16:45,956 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-01-07 04:16:45,957 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:16:45,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:16:45,958 INFO L82 PathProgramCache]: Analyzing trace with hash 901612414, now seen corresponding path program 1 times [2021-01-07 04:16:45,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:16:45,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857005327] [2021-01-07 04:16:45,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:16:45,979 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:16:45,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1022666699] [2021-01-07 04:16:45,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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-01-07 04:16:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:16:46,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 04:16:46,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:16:46,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:16:46,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857005327] [2021-01-07 04:16:46,361 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:16:46,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022666699] [2021-01-07 04:16:46,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:16:46,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:16:46,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65364041] [2021-01-07 04:16:46,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:16:46,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:16:46,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:16:46,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:16:46,363 INFO L87 Difference]: Start difference. First operand 385 states and 476 transitions. Second operand 4 states. [2021-01-07 04:16:46,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:16:46,482 INFO L93 Difference]: Finished difference Result 724 states and 901 transitions. [2021-01-07 04:16:46,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:16:46,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2021-01-07 04:16:46,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:16:46,485 INFO L225 Difference]: With dead ends: 724 [2021-01-07 04:16:46,485 INFO L226 Difference]: Without dead ends: 391 [2021-01-07 04:16:46,486 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:16:46,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2021-01-07 04:16:46,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 385. [2021-01-07 04:16:46,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2021-01-07 04:16:46,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 475 transitions. [2021-01-07 04:16:46,503 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 475 transitions. Word has length 78 [2021-01-07 04:16:46,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:16:46,504 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 475 transitions. [2021-01-07 04:16:46,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:16:46,504 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 475 transitions. [2021-01-07 04:16:46,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-01-07 04:16:46,505 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:16:46,505 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-07 04:16:46,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:16:46,718 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:16:46,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:16:46,719 INFO L82 PathProgramCache]: Analyzing trace with hash -611683268, now seen corresponding path program 1 times [2021-01-07 04:16:46,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:16:46,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45656826] [2021-01-07 04:16:46,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:16:46,760 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:16:46,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1178641598] [2021-01-07 04:16:46,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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-01-07 04:16:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:16:47,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:16:47,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:16:47,120 INFO L382 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-01-07 04:16:47,121 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:16:47,124 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:16:47,125 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:16:47,125 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2021-01-07 04:16:47,142 INFO L382 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 15 treesize of output 7 [2021-01-07 04:16:47,144 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:16:47,146 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:16:47,147 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:16:47,147 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2021-01-07 04:16:47,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 04:16:47,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45656826] [2021-01-07 04:16:47,160 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:16:47,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178641598] [2021-01-07 04:16:47,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:16:47,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:16:47,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344851790] [2021-01-07 04:16:47,161 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:16:47,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:16:47,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:16:47,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:16:47,162 INFO L87 Difference]: Start difference. First operand 385 states and 475 transitions. Second operand 4 states. [2021-01-07 04:16:47,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:16:47,615 INFO L93 Difference]: Finished difference Result 535 states and 665 transitions. [2021-01-07 04:16:47,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:16:47,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2021-01-07 04:16:47,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:16:47,618 INFO L225 Difference]: With dead ends: 535 [2021-01-07 04:16:47,619 INFO L226 Difference]: Without dead ends: 480 [2021-01-07 04:16:47,619 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:16:47,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2021-01-07 04:16:47,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 387. [2021-01-07 04:16:47,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2021-01-07 04:16:47,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 477 transitions. [2021-01-07 04:16:47,636 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 477 transitions. Word has length 79 [2021-01-07 04:16:47,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:16:47,637 INFO L481 AbstractCegarLoop]: Abstraction has 387 states and 477 transitions. [2021-01-07 04:16:47,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:16:47,637 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 477 transitions. [2021-01-07 04:16:47,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-01-07 04:16:47,638 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:16:47,638 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-07 04:16:47,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:16:47,852 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:16:47,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:16:47,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1201768388, now seen corresponding path program 1 times [2021-01-07 04:16:47,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:16:47,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511465691] [2021-01-07 04:16:47,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:16:47,872 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:16:47,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [25530018] [2021-01-07 04:16:47,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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-01-07 04:16:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:16:48,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 16 conjunts are in the unsatisfiable core [2021-01-07 04:16:48,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:16:48,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:16:48,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511465691] [2021-01-07 04:16:48,286 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:16:48,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25530018] [2021-01-07 04:16:48,286 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:16:48,286 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 04:16:48,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081562403] [2021-01-07 04:16:48,287 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 04:16:48,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:16:48,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 04:16:48,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:16:48,288 INFO L87 Difference]: Start difference. First operand 387 states and 477 transitions. Second operand 5 states. [2021-01-07 04:16:48,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:16:48,440 INFO L93 Difference]: Finished difference Result 724 states and 901 transitions. [2021-01-07 04:16:48,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 04:16:48,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2021-01-07 04:16:48,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:16:48,442 INFO L225 Difference]: With dead ends: 724 [2021-01-07 04:16:48,443 INFO L226 Difference]: Without dead ends: 389 [2021-01-07 04:16:48,443 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 04:16:48,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-01-07 04:16:48,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2021-01-07 04:16:48,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2021-01-07 04:16:48,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 479 transitions. [2021-01-07 04:16:48,460 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 479 transitions. Word has length 81 [2021-01-07 04:16:48,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:16:48,461 INFO L481 AbstractCegarLoop]: Abstraction has 389 states and 479 transitions. [2021-01-07 04:16:48,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 04:16:48,461 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 479 transitions. [2021-01-07 04:16:48,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-01-07 04:16:48,466 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:16:48,466 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-07 04:16:48,680 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-07 04:16:48,681 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:16:48,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:16:48,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1914773501, now seen corresponding path program 1 times [2021-01-07 04:16:48,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:16:48,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138116972] [2021-01-07 04:16:48,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:16:48,702 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:16:48,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [510710717] [2021-01-07 04:16:48,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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-01-07 04:16:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:16:49,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 17 conjunts are in the unsatisfiable core [2021-01-07 04:16:49,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:16:49,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 04:16:49,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138116972] [2021-01-07 04:16:49,234 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:16:49,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510710717] [2021-01-07 04:16:49,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:16:49,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2021-01-07 04:16:49,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226110333] [2021-01-07 04:16:49,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 04:16:49,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:16:49,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 04:16:49,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-07 04:16:49,239 INFO L87 Difference]: Start difference. First operand 389 states and 479 transitions. Second operand 6 states. [2021-01-07 04:16:49,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:16:49,480 INFO L93 Difference]: Finished difference Result 728 states and 905 transitions. [2021-01-07 04:16:49,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 04:16:49,481 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2021-01-07 04:16:49,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:16:49,483 INFO L225 Difference]: With dead ends: 728 [2021-01-07 04:16:49,483 INFO L226 Difference]: Without dead ends: 391 [2021-01-07 04:16:49,484 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-01-07 04:16:49,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2021-01-07 04:16:49,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2021-01-07 04:16:49,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2021-01-07 04:16:49,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 481 transitions. [2021-01-07 04:16:49,501 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 481 transitions. Word has length 83 [2021-01-07 04:16:49,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:16:49,501 INFO L481 AbstractCegarLoop]: Abstraction has 391 states and 481 transitions. [2021-01-07 04:16:49,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 04:16:49,501 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 481 transitions. [2021-01-07 04:16:49,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-07 04:16:49,502 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:16:49,502 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-07 04:16:49,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:16:49,716 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:16:49,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:16:49,718 INFO L82 PathProgramCache]: Analyzing trace with hash 931638948, now seen corresponding path program 2 times [2021-01-07 04:16:49,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:16:49,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991602596] [2021-01-07 04:16:49,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:16:49,735 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:16:49,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1141005076] [2021-01-07 04:16:49,736 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/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