/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_OAT_test6-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 16:21:58,007 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 16:21:58,012 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 16:21:58,077 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 16:21:58,078 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 16:21:58,083 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 16:21:58,088 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 16:21:58,110 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 16:21:58,115 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 16:21:58,122 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 16:21:58,127 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 16:21:58,129 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 16:21:58,129 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 16:21:58,133 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 16:21:58,135 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 16:21:58,137 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 16:21:58,138 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 16:21:58,142 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 16:21:58,150 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 16:21:58,158 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 16:21:58,160 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 16:21:58,162 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 16:21:58,164 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 16:21:58,167 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 16:21:58,177 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 16:21:58,178 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 16:21:58,178 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 16:21:58,181 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 16:21:58,183 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 16:21:58,184 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 16:21:58,185 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 16:21:58,186 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 16:21:58,188 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 16:21:58,189 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 16:21:58,191 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 16:21:58,191 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 16:21:58,192 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 16:21:58,199 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 16:21:58,200 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 16:21:58,201 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 16:21:58,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 16:21:58,203 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 16:21:58,250 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 16:21:58,251 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 16:21:58,255 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 16:21:58,256 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 16:21:58,256 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 16:21:58,256 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 16:21:58,257 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 16:21:58,257 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 16:21:58,257 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 16:21:58,257 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 16:21:58,258 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 16:21:58,259 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 16:21:58,259 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 16:21:58,259 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 16:21:58,260 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 16:21:58,260 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 16:21:58,260 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 16:21:58,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 16:21:58,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 16:21:58,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 16:21:58,261 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 16:21:58,261 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 16:21:58,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 16:21:58,262 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 16:21:58,262 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 16:21:58,262 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 [2020-12-23 16:21:58,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 16:21:58,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 16:21:58,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 16:21:58,799 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 16:21:58,800 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 16:21:58,801 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_OAT_test6-2.i [2020-12-23 16:21:58,897 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/5de404d36/8e3e6d03e11c4ba6a0a0b4c93d11b2c6/FLAGbf7722526 [2020-12-23 16:21:59,824 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 16:21:59,825 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i [2020-12-23 16:21:59,876 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/5de404d36/8e3e6d03e11c4ba6a0a0b4c93d11b2c6/FLAGbf7722526 [2020-12-23 16:22:00,002 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/5de404d36/8e3e6d03e11c4ba6a0a0b4c93d11b2c6 [2020-12-23 16:22:00,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 16:22:00,008 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 16:22:00,013 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 16:22:00,013 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 16:22:00,018 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 16:22:00,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 04:22:00" (1/1) ... [2020-12-23 16:22:00,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35948dc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:22:00, skipping insertion in model container [2020-12-23 16:22:00,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 04:22:00" (1/1) ... [2020-12-23 16:22:00,030 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 16:22:00,094 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 16:22:00,844 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_OAT_test6-2.i[44118,44131] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~alt_malloc_sizes~0,GLOBAL],[IdentifierExpression[#t~post33,]]] [2020-12-23 16:22:00,864 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_OAT_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]]]] [2020-12-23 16:22:01,004 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_OAT_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,] [2020-12-23 16:22:01,006 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_OAT_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]]]] [2020-12-23 16:22:01,033 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 16:22:01,053 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 16:22:01,120 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_OAT_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,]]]]] [2020-12-23 16:22:01,123 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_OAT_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]]]] [2020-12-23 16:22:01,309 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_OAT_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,] [2020-12-23 16:22:01,314 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_OAT_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]]]] [2020-12-23 16:22:01,339 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 16:22:01,542 INFO L208 MainTranslator]: Completed translation [2020-12-23 16:22:01,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:22:01 WrapperNode [2020-12-23 16:22:01,543 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 16:22:01,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 16:22:01,545 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 16:22:01,546 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 16:22:01,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:22:01" (1/1) ... [2020-12-23 16:22:01,648 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:22:01" (1/1) ... [2020-12-23 16:22:01,772 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 16:22:01,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 16:22:01,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 16:22:01,773 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 16:22:01,784 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:22:01" (1/1) ... [2020-12-23 16:22:01,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:22:01" (1/1) ... [2020-12-23 16:22:01,796 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:22:01" (1/1) ... [2020-12-23 16:22:01,797 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:22:01" (1/1) ... [2020-12-23 16:22:01,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:22:01" (1/1) ... [2020-12-23 16:22:01,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:22:01" (1/1) ... [2020-12-23 16:22:01,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:22:01" (1/1) ... [2020-12-23 16:22:01,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 16:22:01,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 16:22:01,998 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 16:22:01,998 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 16:22:02,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:22:01" (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 [2020-12-23 16:22:02,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 16:22:02,128 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2020-12-23 16:22:02,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 16:22:02,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 16:22:02,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 16:22:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 16:22:02,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 16:22:02,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 16:22:02,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 16:22:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 16:22:02,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 16:22:04,871 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 16:22:04,872 INFO L299 CfgBuilder]: Removed 124 assume(true) statements. [2020-12-23 16:22:04,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 04:22:04 BoogieIcfgContainer [2020-12-23 16:22:04,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 16:22:04,876 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 16:22:04,877 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 16:22:04,881 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 16:22:04,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 04:22:00" (1/3) ... [2020-12-23 16:22:04,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ff6bebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 04:22:04, skipping insertion in model container [2020-12-23 16:22:04,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:22:01" (2/3) ... [2020-12-23 16:22:04,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ff6bebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 04:22:04, skipping insertion in model container [2020-12-23 16:22:04,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 04:22:04" (3/3) ... [2020-12-23 16:22:04,885 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test6-2.i [2020-12-23 16:22:04,892 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 16:22:04,899 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2020-12-23 16:22:04,921 INFO L253 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2020-12-23 16:22:04,955 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 16:22:04,955 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 16:22:04,955 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 16:22:04,955 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 16:22:04,955 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 16:22:04,955 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 16:22:04,956 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 16:22:04,956 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 16:22:04,982 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states. [2020-12-23 16:22:04,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-23 16:22:04,989 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:22:04,990 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:22:04,990 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]=== [2020-12-23 16:22:04,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:22:04,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1030621672, now seen corresponding path program 1 times [2020-12-23 16:22:05,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:22:05,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190610836] [2020-12-23 16:22:05,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:22:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:22:05,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:22:05,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190610836] [2020-12-23 16:22:05,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:22:05,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 16:22:05,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911288066] [2020-12-23 16:22:05,219 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 16:22:05,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:22:05,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 16:22:05,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 16:22:05,239 INFO L87 Difference]: Start difference. First operand 276 states. Second operand 2 states. [2020-12-23 16:22:05,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:22:05,337 INFO L93 Difference]: Finished difference Result 544 states and 861 transitions. [2020-12-23 16:22:05,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 16:22:05,342 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2020-12-23 16:22:05,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:22:05,371 INFO L225 Difference]: With dead ends: 544 [2020-12-23 16:22:05,371 INFO L226 Difference]: Without dead ends: 266 [2020-12-23 16:22:05,384 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 [2020-12-23 16:22:05,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-12-23 16:22:05,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2020-12-23 16:22:05,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2020-12-23 16:22:05,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 335 transitions. [2020-12-23 16:22:05,454 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 335 transitions. Word has length 8 [2020-12-23 16:22:05,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:22:05,455 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 335 transitions. [2020-12-23 16:22:05,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 16:22:05,455 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 335 transitions. [2020-12-23 16:22:05,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-23 16:22:05,456 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:22:05,456 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:22:05,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 16:22:05,457 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]=== [2020-12-23 16:22:05,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:22:05,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1260005844, now seen corresponding path program 1 times [2020-12-23 16:22:05,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:22:05,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867498608] [2020-12-23 16:22:05,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:22:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:22:05,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:22:05,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867498608] [2020-12-23 16:22:05,592 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:22:05,592 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 16:22:05,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809179438] [2020-12-23 16:22:05,599 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:22:05,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:22:05,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:22:05,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:22:05,602 INFO L87 Difference]: Start difference. First operand 266 states and 335 transitions. Second operand 4 states. [2020-12-23 16:22:06,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:22:06,268 INFO L93 Difference]: Finished difference Result 589 states and 741 transitions. [2020-12-23 16:22:06,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:22:06,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-12-23 16:22:06,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:22:06,274 INFO L225 Difference]: With dead ends: 589 [2020-12-23 16:22:06,274 INFO L226 Difference]: Without dead ends: 440 [2020-12-23 16:22:06,277 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 [2020-12-23 16:22:06,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-12-23 16:22:06,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 268. [2020-12-23 16:22:06,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2020-12-23 16:22:06,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 337 transitions. [2020-12-23 16:22:06,327 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 337 transitions. Word has length 10 [2020-12-23 16:22:06,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:22:06,327 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 337 transitions. [2020-12-23 16:22:06,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:22:06,328 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 337 transitions. [2020-12-23 16:22:06,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-23 16:22:06,329 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:22:06,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] [2020-12-23 16:22:06,330 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 16:22:06,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]=== [2020-12-23 16:22:06,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:22:06,331 INFO L82 PathProgramCache]: Analyzing trace with hash -602340381, now seen corresponding path program 1 times [2020-12-23 16:22:06,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:22:06,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661648886] [2020-12-23 16:22:06,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:22:06,396 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:22:06,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [716116770] [2020-12-23 16:22:06,398 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 [2020-12-23 16:22:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:22:06,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:22:06,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:22:06,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:22:06,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661648886] [2020-12-23 16:22:06,823 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:22:06,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716116770] [2020-12-23 16:22:06,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:22:06,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:22:06,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775786552] [2020-12-23 16:22:06,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:22:06,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:22:06,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:22:06,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:22:06,840 INFO L87 Difference]: Start difference. First operand 268 states and 337 transitions. Second operand 3 states. [2020-12-23 16:22:06,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:22:06,952 INFO L93 Difference]: Finished difference Result 553 states and 701 transitions. [2020-12-23 16:22:06,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:22:06,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-12-23 16:22:06,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:22:06,955 INFO L225 Difference]: With dead ends: 553 [2020-12-23 16:22:06,955 INFO L226 Difference]: Without dead ends: 289 [2020-12-23 16:22:06,956 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 [2020-12-23 16:22:06,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-12-23 16:22:06,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 288. [2020-12-23 16:22:06,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2020-12-23 16:22:06,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 357 transitions. [2020-12-23 16:22:06,967 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 357 transitions. Word has length 44 [2020-12-23 16:22:06,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:22:06,967 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 357 transitions. [2020-12-23 16:22:06,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:22:06,968 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 357 transitions. [2020-12-23 16:22:06,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-23 16:22:06,969 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:22:06,969 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] [2020-12-23 16:22:07,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-12-23 16:22:07,185 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]=== [2020-12-23 16:22:07,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:22:07,187 INFO L82 PathProgramCache]: Analyzing trace with hash -821195099, now seen corresponding path program 1 times [2020-12-23 16:22:07,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:22:07,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032530200] [2020-12-23 16:22:07,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:22:07,213 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:22:07,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1824940543] [2020-12-23 16:22:07,214 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 [2020-12-23 16:22:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:22:07,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:22:07,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:22:07,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:22:07,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032530200] [2020-12-23 16:22:07,576 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:22:07,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824940543] [2020-12-23 16:22:07,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:22:07,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 16:22:07,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383141566] [2020-12-23 16:22:07,578 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:22:07,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:22:07,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:22:07,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:22:07,579 INFO L87 Difference]: Start difference. First operand 288 states and 357 transitions. Second operand 4 states. [2020-12-23 16:22:07,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:22:07,694 INFO L93 Difference]: Finished difference Result 565 states and 703 transitions. [2020-12-23 16:22:07,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:22:07,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2020-12-23 16:22:07,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:22:07,697 INFO L225 Difference]: With dead ends: 565 [2020-12-23 16:22:07,697 INFO L226 Difference]: Without dead ends: 281 [2020-12-23 16:22:07,698 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 [2020-12-23 16:22:07,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-12-23 16:22:07,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 274. [2020-12-23 16:22:07,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2020-12-23 16:22:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 336 transitions. [2020-12-23 16:22:07,708 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 336 transitions. Word has length 44 [2020-12-23 16:22:07,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:22:07,709 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 336 transitions. [2020-12-23 16:22:07,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:22:07,710 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 336 transitions. [2020-12-23 16:22:07,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-23 16:22:07,714 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:22:07,714 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] [2020-12-23 16:22:07,928 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:22:07,929 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]=== [2020-12-23 16:22:07,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:22:07,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1704043945, now seen corresponding path program 1 times [2020-12-23 16:22:07,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:22:07,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666779051] [2020-12-23 16:22:07,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:22:07,980 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:22:07,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1189599500] [2020-12-23 16:22:07,983 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 [2020-12-23 16:22:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:22:08,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-23 16:22:08,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:22:08,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:22:08,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666779051] [2020-12-23 16:22:08,424 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:22:08,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189599500] [2020-12-23 16:22:08,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:22:08,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 16:22:08,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023027729] [2020-12-23 16:22:08,426 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 16:22:08,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:22:08,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 16:22:08,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 16:22:08,427 INFO L87 Difference]: Start difference. First operand 274 states and 336 transitions. Second operand 6 states. [2020-12-23 16:22:09,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:22:09,271 INFO L93 Difference]: Finished difference Result 486 states and 600 transitions. [2020-12-23 16:22:09,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 16:22:09,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2020-12-23 16:22:09,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:22:09,276 INFO L225 Difference]: With dead ends: 486 [2020-12-23 16:22:09,277 INFO L226 Difference]: Without dead ends: 484 [2020-12-23 16:22:09,278 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 [2020-12-23 16:22:09,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2020-12-23 16:22:09,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 272. [2020-12-23 16:22:09,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2020-12-23 16:22:09,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 334 transitions. [2020-12-23 16:22:09,297 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 334 transitions. Word has length 44 [2020-12-23 16:22:09,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:22:09,298 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 334 transitions. [2020-12-23 16:22:09,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 16:22:09,298 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 334 transitions. [2020-12-23 16:22:09,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-23 16:22:09,304 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:22:09,304 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] [2020-12-23 16:22:09,517 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:22:09,518 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]=== [2020-12-23 16:22:09,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:22:09,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1088553020, now seen corresponding path program 1 times [2020-12-23 16:22:09,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:22:09,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447198313] [2020-12-23 16:22:09,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:22:09,561 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:22:09,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [210987038] [2020-12-23 16:22:09,565 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 [2020-12-23 16:22:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:22:09,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 16:22:09,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:22:10,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:22:10,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447198313] [2020-12-23 16:22:10,005 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:22:10,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210987038] [2020-12-23 16:22:10,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:22:10,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 16:22:10,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304857319] [2020-12-23 16:22:10,007 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 16:22:10,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:22:10,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 16:22:10,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:22:10,009 INFO L87 Difference]: Start difference. First operand 272 states and 334 transitions. Second operand 5 states. [2020-12-23 16:22:10,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:22:10,245 INFO L93 Difference]: Finished difference Result 1120 states and 1390 transitions. [2020-12-23 16:22:10,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 16:22:10,246 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2020-12-23 16:22:10,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:22:10,251 INFO L225 Difference]: With dead ends: 1120 [2020-12-23 16:22:10,251 INFO L226 Difference]: Without dead ends: 852 [2020-12-23 16:22:10,253 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 [2020-12-23 16:22:10,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2020-12-23 16:22:10,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 364. [2020-12-23 16:22:10,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2020-12-23 16:22:10,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 445 transitions. [2020-12-23 16:22:10,276 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 445 transitions. Word has length 51 [2020-12-23 16:22:10,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:22:10,276 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 445 transitions. [2020-12-23 16:22:10,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 16:22:10,276 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 445 transitions. [2020-12-23 16:22:10,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-23 16:22:10,277 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:22:10,278 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] [2020-12-23 16:22:10,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:22:10,492 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]=== [2020-12-23 16:22:10,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:22:10,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1193587178, now seen corresponding path program 1 times [2020-12-23 16:22:10,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:22:10,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055451746] [2020-12-23 16:22:10,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:22:10,522 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:22:10,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1678623280] [2020-12-23 16:22:10,523 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 [2020-12-23 16:22:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:22:10,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 16:22:10,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:22:10,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:22:10,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055451746] [2020-12-23 16:22:10,905 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:22:10,906 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678623280] [2020-12-23 16:22:10,906 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:22:10,906 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:22:10,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426439279] [2020-12-23 16:22:10,906 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:22:10,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:22:10,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:22:10,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:22:10,908 INFO L87 Difference]: Start difference. First operand 364 states and 445 transitions. Second operand 3 states. [2020-12-23 16:22:11,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:22:11,137 INFO L93 Difference]: Finished difference Result 802 states and 981 transitions. [2020-12-23 16:22:11,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:22:11,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-12-23 16:22:11,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:22:11,140 INFO L225 Difference]: With dead ends: 802 [2020-12-23 16:22:11,141 INFO L226 Difference]: Without dead ends: 442 [2020-12-23 16:22:11,143 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 [2020-12-23 16:22:11,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2020-12-23 16:22:11,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 385. [2020-12-23 16:22:11,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-12-23 16:22:11,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 476 transitions. [2020-12-23 16:22:11,192 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 476 transitions. Word has length 54 [2020-12-23 16:22:11,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:22:11,195 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 476 transitions. [2020-12-23 16:22:11,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:22:11,195 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 476 transitions. [2020-12-23 16:22:11,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-23 16:22:11,198 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:22:11,198 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] [2020-12-23 16:22:11,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-23 16:22:11,412 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]=== [2020-12-23 16:22:11,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:22:11,414 INFO L82 PathProgramCache]: Analyzing trace with hash 901612414, now seen corresponding path program 1 times [2020-12-23 16:22:11,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:22:11,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325368274] [2020-12-23 16:22:11,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:22:11,447 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:22:11,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [658037072] [2020-12-23 16:22:11,448 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 [2020-12-23 16:22:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:22:11,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 16:22:11,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:22:11,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:22:11,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325368274] [2020-12-23 16:22:11,909 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:22:11,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658037072] [2020-12-23 16:22:11,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:22:11,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:22:11,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479904890] [2020-12-23 16:22:11,912 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:22:11,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:22:11,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:22:11,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:22:11,913 INFO L87 Difference]: Start difference. First operand 385 states and 476 transitions. Second operand 4 states. [2020-12-23 16:22:12,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:22:12,084 INFO L93 Difference]: Finished difference Result 724 states and 901 transitions. [2020-12-23 16:22:12,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:22:12,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2020-12-23 16:22:12,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:22:12,089 INFO L225 Difference]: With dead ends: 724 [2020-12-23 16:22:12,089 INFO L226 Difference]: Without dead ends: 391 [2020-12-23 16:22:12,091 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 [2020-12-23 16:22:12,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2020-12-23 16:22:12,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 385. [2020-12-23 16:22:12,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-12-23 16:22:12,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 475 transitions. [2020-12-23 16:22:12,107 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 475 transitions. Word has length 78 [2020-12-23 16:22:12,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:22:12,108 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 475 transitions. [2020-12-23 16:22:12,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:22:12,108 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 475 transitions. [2020-12-23 16:22:12,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-23 16:22:12,109 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:22:12,109 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] [2020-12-23 16:22:12,324 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:22:12,325 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]=== [2020-12-23 16:22:12,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:22:12,326 INFO L82 PathProgramCache]: Analyzing trace with hash -611683268, now seen corresponding path program 1 times [2020-12-23 16:22:12,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:22:12,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510595187] [2020-12-23 16:22:12,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:22:12,351 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:22:12,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1817136633] [2020-12-23 16:22:12,353 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 [2020-12-23 16:22:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:22:12,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:22:12,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:22:12,758 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 [2020-12-23 16:22:12,759 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:22:12,762 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:22:12,763 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:22:12,763 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-12-23 16:22:12,784 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 [2020-12-23 16:22:12,786 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:22:12,788 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:22:12,789 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:22:12,790 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-12-23 16:22:12,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 16:22:12,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510595187] [2020-12-23 16:22:12,804 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:22:12,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817136633] [2020-12-23 16:22:12,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:22:12,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 16:22:12,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55366214] [2020-12-23 16:22:12,805 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:22:12,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:22:12,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:22:12,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:22:12,806 INFO L87 Difference]: Start difference. First operand 385 states and 475 transitions. Second operand 4 states. [2020-12-23 16:22:13,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:22:13,335 INFO L93 Difference]: Finished difference Result 535 states and 665 transitions. [2020-12-23 16:22:13,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:22:13,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2020-12-23 16:22:13,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:22:13,339 INFO L225 Difference]: With dead ends: 535 [2020-12-23 16:22:13,340 INFO L226 Difference]: Without dead ends: 480 [2020-12-23 16:22:13,340 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 [2020-12-23 16:22:13,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2020-12-23 16:22:13,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 387. [2020-12-23 16:22:13,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-12-23 16:22:13,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 477 transitions. [2020-12-23 16:22:13,357 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 477 transitions. Word has length 79 [2020-12-23 16:22:13,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:22:13,358 INFO L481 AbstractCegarLoop]: Abstraction has 387 states and 477 transitions. [2020-12-23 16:22:13,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:22:13,358 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 477 transitions. [2020-12-23 16:22:13,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-23 16:22:13,359 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:22:13,359 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] [2020-12-23 16:22:13,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:22:13,575 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]=== [2020-12-23 16:22:13,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:22:13,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1201768388, now seen corresponding path program 1 times [2020-12-23 16:22:13,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:22:13,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260071660] [2020-12-23 16:22:13,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:22:13,597 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:22:13,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [113037747] [2020-12-23 16:22:13,597 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 [2020-12-23 16:22:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:22:13,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-23 16:22:13,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:22:14,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:22:14,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260071660] [2020-12-23 16:22:14,049 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:22:14,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113037747] [2020-12-23 16:22:14,049 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:22:14,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 16:22:14,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253477244] [2020-12-23 16:22:14,050 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 16:22:14,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:22:14,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 16:22:14,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:22:14,051 INFO L87 Difference]: Start difference. First operand 387 states and 477 transitions. Second operand 5 states. [2020-12-23 16:22:14,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:22:14,173 INFO L93 Difference]: Finished difference Result 724 states and 901 transitions. [2020-12-23 16:22:14,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 16:22:14,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2020-12-23 16:22:14,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:22:14,177 INFO L225 Difference]: With dead ends: 724 [2020-12-23 16:22:14,177 INFO L226 Difference]: Without dead ends: 389 [2020-12-23 16:22:14,178 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 [2020-12-23 16:22:14,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2020-12-23 16:22:14,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2020-12-23 16:22:14,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-12-23 16:22:14,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 479 transitions. [2020-12-23 16:22:14,195 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 479 transitions. Word has length 81 [2020-12-23 16:22:14,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:22:14,195 INFO L481 AbstractCegarLoop]: Abstraction has 389 states and 479 transitions. [2020-12-23 16:22:14,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 16:22:14,195 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 479 transitions. [2020-12-23 16:22:14,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-23 16:22:14,196 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:22:14,196 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] [2020-12-23 16:22:14,409 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-23 16:22:14,410 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]=== [2020-12-23 16:22:14,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:22:14,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1914773501, now seen corresponding path program 1 times [2020-12-23 16:22:14,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:22:14,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685325618] [2020-12-23 16:22:14,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:22:14,432 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:22:14,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1293236817] [2020-12-23 16:22:14,432 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 [2020-12-23 16:22:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:22:14,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-23 16:22:14,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:22:14,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 16:22:14,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685325618] [2020-12-23 16:22:14,973 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:22:14,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293236817] [2020-12-23 16:22:14,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:22:14,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-12-23 16:22:14,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135514716] [2020-12-23 16:22:14,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 16:22:14,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:22:14,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 16:22:14,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-23 16:22:14,975 INFO L87 Difference]: Start difference. First operand 389 states and 479 transitions. Second operand 6 states. [2020-12-23 16:22:15,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:22:15,159 INFO L93 Difference]: Finished difference Result 728 states and 905 transitions. [2020-12-23 16:22:15,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 16:22:15,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2020-12-23 16:22:15,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:22:15,162 INFO L225 Difference]: With dead ends: 728 [2020-12-23 16:22:15,162 INFO L226 Difference]: Without dead ends: 391 [2020-12-23 16:22:15,163 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-12-23 16:22:15,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2020-12-23 16:22:15,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2020-12-23 16:22:15,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-12-23 16:22:15,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 481 transitions. [2020-12-23 16:22:15,181 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 481 transitions. Word has length 83 [2020-12-23 16:22:15,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:22:15,182 INFO L481 AbstractCegarLoop]: Abstraction has 391 states and 481 transitions. [2020-12-23 16:22:15,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 16:22:15,182 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 481 transitions. [2020-12-23 16:22:15,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-23 16:22:15,182 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:22:15,183 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] [2020-12-23 16:22:15,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:22:15,398 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]=== [2020-12-23 16:22:15,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:22:15,399 INFO L82 PathProgramCache]: Analyzing trace with hash 931638948, now seen corresponding path program 2 times [2020-12-23 16:22:15,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:22:15,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892099715] [2020-12-23 16:22:15,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:22:15,420 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:22:15,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [670322831] [2020-12-23 16:22:15,421 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