/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_SFH_test4-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 16:34:33,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 16:34:33,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 16:34:33,467 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 16:34:33,468 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 16:34:33,470 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 16:34:33,471 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 16:34:33,474 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 16:34:33,477 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 16:34:33,478 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 16:34:33,480 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 16:34:33,481 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 16:34:33,482 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 16:34:33,483 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 16:34:33,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 16:34:33,486 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 16:34:33,487 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 16:34:33,489 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 16:34:33,491 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 16:34:33,494 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 16:34:33,496 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 16:34:33,498 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 16:34:33,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 16:34:33,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 16:34:33,519 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 16:34:33,519 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 16:34:33,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 16:34:33,523 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 16:34:33,524 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 16:34:33,525 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 16:34:33,525 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 16:34:33,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 16:34:33,527 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 16:34:33,528 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 16:34:33,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 16:34:33,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 16:34:33,530 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 16:34:33,530 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 16:34:33,531 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 16:34:33,532 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 16:34:33,533 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 16:34:33,534 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:34:33,561 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 16:34:33,562 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 16:34:33,563 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 16:34:33,564 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 16:34:33,564 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 16:34:33,564 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 16:34:33,564 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 16:34:33,565 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 16:34:33,565 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 16:34:33,565 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 16:34:33,565 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 16:34:33,565 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 16:34:33,566 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 16:34:33,566 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 16:34:33,566 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 16:34:33,566 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 16:34:33,566 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 16:34:33,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 16:34:33,567 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 16:34:33,567 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 16:34:33,567 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 16:34:33,567 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 16:34:33,568 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 16:34:33,568 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 16:34:33,568 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 16:34:33,568 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:34:33,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 16:34:33,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 16:34:34,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 16:34:34,005 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 16:34:34,006 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 16:34:34,007 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_SFH_test4-2.i [2020-12-23 16:34:34,114 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a6a2ec722/19b8e58941ae40aea21bf24a87d7251f/FLAG79c7cfa78 [2020-12-23 16:34:34,974 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 16:34:34,978 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-2.i [2020-12-23 16:34:35,017 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a6a2ec722/19b8e58941ae40aea21bf24a87d7251f/FLAG79c7cfa78 [2020-12-23 16:34:35,130 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a6a2ec722/19b8e58941ae40aea21bf24a87d7251f [2020-12-23 16:34:35,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 16:34:35,138 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 16:34:35,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 16:34:35,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 16:34:35,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 16:34:35,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 04:34:35" (1/1) ... [2020-12-23 16:34:35,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55bb0297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:34:35, skipping insertion in model container [2020-12-23 16:34:35,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 04:34:35" (1/1) ... [2020-12-23 16:34:35,171 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 16:34:35,256 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 16:34:35,754 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_SFH_test4-2.i[33021,33034] 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~mem37,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem37,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem38,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem38,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem39,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem39,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem40,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem40,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem41,],base],StructAccessExpression[IdentifierExpression[#t~mem41,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem43,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem43,],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~mem56,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem56,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem57,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem57,],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~mem69,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem69,],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~mem81,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem81,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem91,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem91,],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~mem117,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem117,],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~mem125,],base],StructAccessExpression[IdentifierExpression[#t~mem125,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem126,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem126,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem136,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem136,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~1,] 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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[104],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem165,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem165,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem166,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem166,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem167,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem167,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem168,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem168,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,],base],StructAccessExpression[IdentifierExpression[#t~mem169,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem171,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem171,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~altusers~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem184,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem184,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem185,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem185,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem197,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem197,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~1,],base],StructAccessExpression[IdentifierExpression[~_ha_head~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_new_buckets~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem209,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem209,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem219,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem219,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem245,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem245,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem253,],base],StructAccessExpression[IdentifierExpression[#t~mem253,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem254,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem254,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem264,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem264,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~user~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[~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~mem280,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem280,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem285,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem285,],offset],IdentifierExpression[#t~mem287,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem291,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem291,],offset],IdentifierExpression[#t~mem293,]]]]] 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~mem305,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem305,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem308,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem308,],offset]]]] [2020-12-23 16:34:35,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 16:34:35,996 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 16:34:36,058 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_SFH_test4-2.i[33021,33034] 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~mem37,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem37,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem38,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem38,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem39,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem39,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem40,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem40,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem41,],base],StructAccessExpression[IdentifierExpression[#t~mem41,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem43,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem43,],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~mem56,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem56,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem57,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem57,],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~mem69,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem69,],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~mem83,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem83,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem93,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem93,],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~mem120,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem120,],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~mem128,],base],StructAccessExpression[IdentifierExpression[#t~mem128,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem130,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem130,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem140,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem140,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~1,] 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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[104],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem169,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem170,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem170,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem171,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem171,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem172,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem172,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem173,],base],StructAccessExpression[IdentifierExpression[#t~mem173,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem175,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem175,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~altusers~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem188,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem188,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem189,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem189,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem201,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem201,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~1,],base],StructAccessExpression[IdentifierExpression[~_ha_head~1,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~#_he_new_buckets~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem215,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem215,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem225,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem225,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~1,],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]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem260,],base],StructAccessExpression[IdentifierExpression[#t~mem260,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem262,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem262,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem272,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem272,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~user~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[~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~mem288,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem288,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem293,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem293,],offset],IdentifierExpression[#t~mem295,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem299,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem299,],offset],IdentifierExpression[#t~mem301,]]]]] 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~mem313,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem313,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem316,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem316,],offset]]]] [2020-12-23 16:34:36,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 16:34:36,379 INFO L208 MainTranslator]: Completed translation [2020-12-23 16:34:36,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:34:36 WrapperNode [2020-12-23 16:34:36,381 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 16:34:36,384 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 16:34:36,384 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 16:34:36,385 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 16:34:36,397 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:34:36" (1/1) ... [2020-12-23 16:34:36,484 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:34:36" (1/1) ... [2020-12-23 16:34:36,588 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 16:34:36,589 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 16:34:36,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 16:34:36,590 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 16:34:36,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:34:36" (1/1) ... [2020-12-23 16:34:36,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:34:36" (1/1) ... [2020-12-23 16:34:36,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:34:36" (1/1) ... [2020-12-23 16:34:36,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:34:36" (1/1) ... [2020-12-23 16:34:36,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:34:36" (1/1) ... [2020-12-23 16:34:36,767 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:34:36" (1/1) ... [2020-12-23 16:34:36,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:34:36" (1/1) ... [2020-12-23 16:34:36,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 16:34:36,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 16:34:36,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 16:34:36,813 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 16:34:36,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:34:36" (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:34:36,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 16:34:36,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 16:34:36,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 16:34:36,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 16:34:36,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 16:34:36,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 16:34:36,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 16:34:36,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 16:34:36,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 16:34:36,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 16:34:39,448 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 16:34:39,449 INFO L299 CfgBuilder]: Removed 107 assume(true) statements. [2020-12-23 16:34:39,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 04:34:39 BoogieIcfgContainer [2020-12-23 16:34:39,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 16:34:39,454 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 16:34:39,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 16:34:39,458 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 16:34:39,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 04:34:35" (1/3) ... [2020-12-23 16:34:39,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1829f017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 04:34:39, skipping insertion in model container [2020-12-23 16:34:39,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:34:36" (2/3) ... [2020-12-23 16:34:39,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1829f017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 04:34:39, skipping insertion in model container [2020-12-23 16:34:39,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 04:34:39" (3/3) ... [2020-12-23 16:34:39,461 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test4-2.i [2020-12-23 16:34:39,468 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 16:34:39,475 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2020-12-23 16:34:39,496 INFO L253 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2020-12-23 16:34:39,529 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 16:34:39,529 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 16:34:39,529 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 16:34:39,529 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 16:34:39,530 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 16:34:39,530 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 16:34:39,530 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 16:34:39,530 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 16:34:39,555 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states. [2020-12-23 16:34:39,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-23 16:34:39,561 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:34:39,562 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:34:39,563 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:34:39,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:34:39,571 INFO L82 PathProgramCache]: Analyzing trace with hash 889550569, now seen corresponding path program 1 times [2020-12-23 16:34:39,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:34:39,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666683033] [2020-12-23 16:34:39,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:34:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:34:39,760 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:34:39,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666683033] [2020-12-23 16:34:39,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:34:39,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 16:34:39,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193400734] [2020-12-23 16:34:39,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 16:34:39,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:34:39,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 16:34:39,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 16:34:39,787 INFO L87 Difference]: Start difference. First operand 250 states. Second operand 2 states. [2020-12-23 16:34:39,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:34:39,844 INFO L93 Difference]: Finished difference Result 498 states and 822 transitions. [2020-12-23 16:34:39,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 16:34:39,846 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2020-12-23 16:34:39,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:34:39,863 INFO L225 Difference]: With dead ends: 498 [2020-12-23 16:34:39,863 INFO L226 Difference]: Without dead ends: 217 [2020-12-23 16:34:39,869 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:34:39,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-12-23 16:34:39,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2020-12-23 16:34:39,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-12-23 16:34:39,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 282 transitions. [2020-12-23 16:34:39,930 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 282 transitions. Word has length 8 [2020-12-23 16:34:39,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:34:39,930 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 282 transitions. [2020-12-23 16:34:39,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 16:34:39,931 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 282 transitions. [2020-12-23 16:34:39,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-23 16:34:39,937 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:34:39,937 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:34:39,937 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 16:34:39,938 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:34:39,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:34:39,939 INFO L82 PathProgramCache]: Analyzing trace with hash 921152950, now seen corresponding path program 1 times [2020-12-23 16:34:39,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:34:39,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469444954] [2020-12-23 16:34:39,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:34:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:34:40,011 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:34:40,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469444954] [2020-12-23 16:34:40,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:34:40,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:34:40,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496811998] [2020-12-23 16:34:40,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:34:40,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:34:40,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:34:40,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:34:40,016 INFO L87 Difference]: Start difference. First operand 217 states and 282 transitions. Second operand 3 states. [2020-12-23 16:34:40,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:34:40,087 INFO L93 Difference]: Finished difference Result 432 states and 562 transitions. [2020-12-23 16:34:40,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:34:40,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-12-23 16:34:40,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:34:40,092 INFO L225 Difference]: With dead ends: 432 [2020-12-23 16:34:40,093 INFO L226 Difference]: Without dead ends: 387 [2020-12-23 16:34:40,094 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:34:40,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2020-12-23 16:34:40,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 218. [2020-12-23 16:34:40,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-12-23 16:34:40,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 283 transitions. [2020-12-23 16:34:40,123 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 283 transitions. Word has length 8 [2020-12-23 16:34:40,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:34:40,123 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 283 transitions. [2020-12-23 16:34:40,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:34:40,124 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 283 transitions. [2020-12-23 16:34:40,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 16:34:40,128 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:34:40,129 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, 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:34:40,129 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 16:34:40,130 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:34:40,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:34:40,131 INFO L82 PathProgramCache]: Analyzing trace with hash -137963571, now seen corresponding path program 1 times [2020-12-23 16:34:40,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:34:40,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94747613] [2020-12-23 16:34:40,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:34:40,164 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:34:40,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [227988714] [2020-12-23 16:34:40,165 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:34:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:34:40,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:34:40,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:34:40,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:34:40,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94747613] [2020-12-23 16:34:40,730 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:34:40,730 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227988714] [2020-12-23 16:34:40,730 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:34:40,730 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:34:40,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536153181] [2020-12-23 16:34:40,731 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:34:40,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:34:40,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:34:40,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:34:40,733 INFO L87 Difference]: Start difference. First operand 218 states and 283 transitions. Second operand 3 states. [2020-12-23 16:34:40,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:34:40,860 INFO L93 Difference]: Finished difference Result 454 states and 594 transitions. [2020-12-23 16:34:40,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:34:40,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-12-23 16:34:40,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:34:40,863 INFO L225 Difference]: With dead ends: 454 [2020-12-23 16:34:40,863 INFO L226 Difference]: Without dead ends: 239 [2020-12-23 16:34:40,865 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 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:34:40,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-12-23 16:34:40,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 238. [2020-12-23 16:34:40,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2020-12-23 16:34:40,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 303 transitions. [2020-12-23 16:34:40,883 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 303 transitions. Word has length 106 [2020-12-23 16:34:40,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:34:40,884 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 303 transitions. [2020-12-23 16:34:40,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:34:40,884 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 303 transitions. [2020-12-23 16:34:40,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 16:34:40,888 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:34:40,889 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:41,103 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-12-23 16:34:41,104 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:34:41,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:34:41,106 INFO L82 PathProgramCache]: Analyzing trace with hash 62310097, now seen corresponding path program 1 times [2020-12-23 16:34:41,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:34:41,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724655007] [2020-12-23 16:34:41,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:34:41,162 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:34:41,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2041113980] [2020-12-23 16:34:41,163 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:34:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:34:41,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:34:41,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:34:41,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:34:41,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724655007] [2020-12-23 16:34:41,673 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:34:41,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041113980] [2020-12-23 16:34:41,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:34:41,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:34:41,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094288707] [2020-12-23 16:34:41,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:34:41,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:34:41,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:34:41,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:34:41,676 INFO L87 Difference]: Start difference. First operand 238 states and 303 transitions. Second operand 3 states. [2020-12-23 16:34:41,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:34:41,788 INFO L93 Difference]: Finished difference Result 494 states and 634 transitions. [2020-12-23 16:34:41,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:34:41,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-12-23 16:34:41,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:34:41,794 INFO L225 Difference]: With dead ends: 494 [2020-12-23 16:34:41,794 INFO L226 Difference]: Without dead ends: 259 [2020-12-23 16:34:41,796 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 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:34:41,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2020-12-23 16:34:41,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 258. [2020-12-23 16:34:41,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2020-12-23 16:34:41,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 323 transitions. [2020-12-23 16:34:41,814 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 323 transitions. Word has length 106 [2020-12-23 16:34:41,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:34:41,814 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 323 transitions. [2020-12-23 16:34:41,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:34:41,815 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 323 transitions. [2020-12-23 16:34:41,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 16:34:41,820 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:34:41,820 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, 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:34:42,034 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:34:42,036 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:34:42,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:34:42,038 INFO L82 PathProgramCache]: Analyzing trace with hash -426500019, now seen corresponding path program 1 times [2020-12-23 16:34:42,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:34:42,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806814460] [2020-12-23 16:34:42,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:34:42,077 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:34:42,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [507375467] [2020-12-23 16:34:42,079 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:34:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:34:42,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:34:42,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:34:42,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:34:42,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806814460] [2020-12-23 16:34:42,595 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:34:42,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507375467] [2020-12-23 16:34:42,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:34:42,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 16:34:42,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601632521] [2020-12-23 16:34:42,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:34:42,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:34:42,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:34:42,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:34:42,598 INFO L87 Difference]: Start difference. First operand 258 states and 323 transitions. Second operand 4 states. [2020-12-23 16:34:42,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:34:42,711 INFO L93 Difference]: Finished difference Result 505 states and 635 transitions. [2020-12-23 16:34:42,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:34:42,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2020-12-23 16:34:42,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:34:42,714 INFO L225 Difference]: With dead ends: 505 [2020-12-23 16:34:42,714 INFO L226 Difference]: Without dead ends: 250 [2020-12-23 16:34:42,715 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 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:34:42,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-12-23 16:34:42,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 244. [2020-12-23 16:34:42,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2020-12-23 16:34:42,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 302 transitions. [2020-12-23 16:34:42,729 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 302 transitions. Word has length 106 [2020-12-23 16:34:42,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:34:42,730 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 302 transitions. [2020-12-23 16:34:42,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:34:42,730 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 302 transitions. [2020-12-23 16:34:42,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 16:34:42,735 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:34:42,735 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, 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:34:42,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:34:42,949 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:34:42,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:34:42,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1791075329, now seen corresponding path program 1 times [2020-12-23 16:34:42,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:34:42,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419113648] [2020-12-23 16:34:42,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:34:42,976 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:34:42,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2127608486] [2020-12-23 16:34:42,978 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:34:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:34:43,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:34:43,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:34:43,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:34:43,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419113648] [2020-12-23 16:34:43,468 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:34:43,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127608486] [2020-12-23 16:34:43,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:34:43,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 16:34:43,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873659867] [2020-12-23 16:34:43,470 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:34:43,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:34:43,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:34:43,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:34:43,474 INFO L87 Difference]: Start difference. First operand 244 states and 302 transitions. Second operand 4 states. [2020-12-23 16:34:43,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:34:43,615 INFO L93 Difference]: Finished difference Result 566 states and 702 transitions. [2020-12-23 16:34:43,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:34:43,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2020-12-23 16:34:43,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:34:43,624 INFO L225 Difference]: With dead ends: 566 [2020-12-23 16:34:43,624 INFO L226 Difference]: Without dead ends: 325 [2020-12-23 16:34:43,629 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 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:34:43,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-12-23 16:34:43,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 230. [2020-12-23 16:34:43,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-12-23 16:34:43,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 281 transitions. [2020-12-23 16:34:43,649 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 281 transitions. Word has length 106 [2020-12-23 16:34:43,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:34:43,653 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 281 transitions. [2020-12-23 16:34:43,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:34:43,653 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 281 transitions. [2020-12-23 16:34:43,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 16:34:43,663 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:34:43,663 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, 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:34:43,877 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:34:43,878 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:34:43,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:34:43,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1369189005, now seen corresponding path program 1 times [2020-12-23 16:34:43,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:34:43,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431315571] [2020-12-23 16:34:43,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:34:43,901 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:34:43,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [45937535] [2020-12-23 16:34:43,902 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:34:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:34:44,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:34:44,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:34:44,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:34:44,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431315571] [2020-12-23 16:34:44,356 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:34:44,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45937535] [2020-12-23 16:34:44,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:34:44,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-12-23 16:34:44,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455934610] [2020-12-23 16:34:44,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:34:44,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:34:44,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:34:44,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:34:44,359 INFO L87 Difference]: Start difference. First operand 230 states and 281 transitions. Second operand 4 states. [2020-12-23 16:34:44,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:34:44,410 INFO L93 Difference]: Finished difference Result 638 states and 780 transitions. [2020-12-23 16:34:44,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:34:44,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2020-12-23 16:34:44,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:34:44,415 INFO L225 Difference]: With dead ends: 638 [2020-12-23 16:34:44,415 INFO L226 Difference]: Without dead ends: 593 [2020-12-23 16:34:44,416 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:34:44,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-12-23 16:34:44,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 412. [2020-12-23 16:34:44,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2020-12-23 16:34:44,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 503 transitions. [2020-12-23 16:34:44,436 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 503 transitions. Word has length 106 [2020-12-23 16:34:44,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:34:44,437 INFO L481 AbstractCegarLoop]: Abstraction has 412 states and 503 transitions. [2020-12-23 16:34:44,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:34:44,437 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 503 transitions. [2020-12-23 16:34:44,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2020-12-23 16:34:44,441 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:34:44,442 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:34:44,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-23 16:34:44,656 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:34:44,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:34:44,657 INFO L82 PathProgramCache]: Analyzing trace with hash 548829604, now seen corresponding path program 2 times [2020-12-23 16:34:44,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:34:44,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814702433] [2020-12-23 16:34:44,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:34:44,725 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:34:44,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [889579817] [2020-12-23 16:34:44,725 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 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:34:44,891 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 16:34:44,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:34:44,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-23 16:34:44,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:34:45,285 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-12-23 16:34:45,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814702433] [2020-12-23 16:34:45,286 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:34:45,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889579817] [2020-12-23 16:34:45,287 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:34:45,287 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 16:34:45,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493393982] [2020-12-23 16:34:45,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:34:45,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:34:45,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:34:45,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:34:45,294 INFO L87 Difference]: Start difference. First operand 412 states and 503 transitions. Second operand 4 states. [2020-12-23 16:34:45,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:34:45,767 INFO L93 Difference]: Finished difference Result 677 states and 831 transitions. [2020-12-23 16:34:45,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:34:45,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2020-12-23 16:34:45,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:34:45,771 INFO L225 Difference]: With dead ends: 677 [2020-12-23 16:34:45,771 INFO L226 Difference]: Without dead ends: 410 [2020-12-23 16:34:45,772 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 201 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:34:45,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2020-12-23 16:34:45,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2020-12-23 16:34:45,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2020-12-23 16:34:45,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 500 transitions. [2020-12-23 16:34:45,796 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 500 transitions. Word has length 204 [2020-12-23 16:34:45,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:34:45,796 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 500 transitions. [2020-12-23 16:34:45,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:34:45,797 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 500 transitions. [2020-12-23 16:34:45,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2020-12-23 16:34:45,800 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:34:45,800 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:34:46,013 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:34:46,014 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:34:46,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:34:46,018 INFO L82 PathProgramCache]: Analyzing trace with hash -7696284, now seen corresponding path program 1 times [2020-12-23 16:34:46,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:34:46,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578402120] [2020-12-23 16:34:46,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:34:46,072 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:34:46,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1441360335] [2020-12-23 16:34:46,073 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:34:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:34:46,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:34:46,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:34:46,713 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-23 16:34:46,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578402120] [2020-12-23 16:34:46,714 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:34:46,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441360335] [2020-12-23 16:34:46,714 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:34:46,714 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:34:46,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597505958] [2020-12-23 16:34:46,715 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:34:46,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:34:46,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:34:46,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:34:46,716 INFO L87 Difference]: Start difference. First operand 410 states and 500 transitions. Second operand 3 states. [2020-12-23 16:34:46,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:34:46,779 INFO L93 Difference]: Finished difference Result 776 states and 957 transitions. [2020-12-23 16:34:46,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:34:46,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2020-12-23 16:34:46,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:34:46,783 INFO L225 Difference]: With dead ends: 776 [2020-12-23 16:34:46,784 INFO L226 Difference]: Without dead ends: 418 [2020-12-23 16:34:46,785 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 209 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:34:46,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2020-12-23 16:34:46,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2020-12-23 16:34:46,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-12-23 16:34:46,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 508 transitions. [2020-12-23 16:34:46,804 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 508 transitions. Word has length 211 [2020-12-23 16:34:46,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:34:46,804 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 508 transitions. [2020-12-23 16:34:46,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:34:46,804 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 508 transitions. [2020-12-23 16:34:46,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-12-23 16:34:46,808 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:34:46,808 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:34:47,023 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:34:47,024 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:34:47,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:34:47,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1887603621, now seen corresponding path program 1 times [2020-12-23 16:34:47,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:34:47,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759325534] [2020-12-23 16:34:47,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:34:47,051 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:34:47,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [866292984] [2020-12-23 16:34:47,052 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:34:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:34:47,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 16:34:47,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:34:47,695 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-12-23 16:34:47,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759325534] [2020-12-23 16:34:47,695 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:34:47,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866292984] [2020-12-23 16:34:47,695 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:34:47,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-12-23 16:34:47,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390288095] [2020-12-23 16:34:47,696 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:34:47,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:34:47,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:34:47,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:34:47,698 INFO L87 Difference]: Start difference. First operand 418 states and 508 transitions. Second operand 4 states. [2020-12-23 16:34:47,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:34:47,776 INFO L93 Difference]: Finished difference Result 791 states and 972 transitions. [2020-12-23 16:34:47,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:34:47,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2020-12-23 16:34:47,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:34:47,780 INFO L225 Difference]: With dead ends: 791 [2020-12-23 16:34:47,780 INFO L226 Difference]: Without dead ends: 426 [2020-12-23 16:34:47,781 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:34:47,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2020-12-23 16:34:47,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2020-12-23 16:34:47,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2020-12-23 16:34:47,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 516 transitions. [2020-12-23 16:34:47,798 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 516 transitions. Word has length 213 [2020-12-23 16:34:47,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:34:47,799 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 516 transitions. [2020-12-23 16:34:47,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:34:47,799 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 516 transitions. [2020-12-23 16:34:47,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-12-23 16:34:47,802 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:34:47,803 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:34:48,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-23 16:34:48,019 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:34:48,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:34:48,020 INFO L82 PathProgramCache]: Analyzing trace with hash -546185468, now seen corresponding path program 2 times [2020-12-23 16:34:48,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:34:48,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972905628] [2020-12-23 16:34:48,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:34:48,044 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:34:48,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1110075440] [2020-12-23 16:34:48,051 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 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:34:48,498 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 16:34:48,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:34:48,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 16:34:48,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:34:48,732 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 84 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-12-23 16:34:48,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972905628] [2020-12-23 16:34:48,733 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:34:48,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110075440] [2020-12-23 16:34:48,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:34:48,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-12-23 16:34:48,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525973392] [2020-12-23 16:34:48,734 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 16:34:48,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:34:48,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 16:34:48,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:34:48,735 INFO L87 Difference]: Start difference. First operand 426 states and 516 transitions. Second operand 5 states. [2020-12-23 16:34:48,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:34:48,814 INFO L93 Difference]: Finished difference Result 806 states and 987 transitions. [2020-12-23 16:34:48,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 16:34:48,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 215 [2020-12-23 16:34:48,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:34:48,818 INFO L225 Difference]: With dead ends: 806 [2020-12-23 16:34:48,818 INFO L226 Difference]: Without dead ends: 434 [2020-12-23 16:34:48,819 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 211 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:34:48,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-12-23 16:34:48,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2020-12-23 16:34:48,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-12-23 16:34:48,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 524 transitions. [2020-12-23 16:34:48,837 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 524 transitions. Word has length 215 [2020-12-23 16:34:48,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:34:48,837 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 524 transitions. [2020-12-23 16:34:48,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 16:34:48,838 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 524 transitions. [2020-12-23 16:34:48,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2020-12-23 16:34:48,840 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:34:48,841 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:34:49,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:34:49,056 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:34:49,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:34:49,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1962229253, now seen corresponding path program 3 times [2020-12-23 16:34:49,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:34:49,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155455993] [2020-12-23 16:34:49,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:34:49,080 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:34:49,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1785855178] [2020-12-23 16:34:49,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2020-12-23 16:34:49,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-23 16:34:49,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:34:49,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 16:34:49,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:34:49,741 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2020-12-23 16:34:49,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155455993] [2020-12-23 16:34:49,742 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:34:49,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785855178] [2020-12-23 16:34:49,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:34:49,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:34:49,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178885707] [2020-12-23 16:34:49,743 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:34:49,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:34:49,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:34:49,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:34:49,750 INFO L87 Difference]: Start difference. First operand 434 states and 524 transitions. Second operand 3 states. [2020-12-23 16:34:49,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:34:49,819 INFO L93 Difference]: Finished difference Result 804 states and 976 transitions. [2020-12-23 16:34:49,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:34:49,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2020-12-23 16:34:49,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:34:49,824 INFO L225 Difference]: With dead ends: 804 [2020-12-23 16:34:49,824 INFO L226 Difference]: Without dead ends: 432 [2020-12-23 16:34:49,825 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 215 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:34:49,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2020-12-23 16:34:49,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2020-12-23 16:34:49,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2020-12-23 16:34:49,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 521 transitions. [2020-12-23 16:34:49,842 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 521 transitions. Word has length 217 [2020-12-23 16:34:49,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:34:49,842 INFO L481 AbstractCegarLoop]: Abstraction has 432 states and 521 transitions. [2020-12-23 16:34:49,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:34:49,843 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 521 transitions. [2020-12-23 16:34:49,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2020-12-23 16:34:49,846 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:34:49,846 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:34:50,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:34:50,062 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:34:50,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:34:50,063 INFO L82 PathProgramCache]: Analyzing trace with hash -511436746, now seen corresponding path program 1 times [2020-12-23 16:34:50,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:34:50,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316488275] [2020-12-23 16:34:50,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:34:50,126 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:34:50,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1778684236] [2020-12-23 16:34:50,127 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:34:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:34:50,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-23 16:34:50,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:34:50,902 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-12-23 16:34:50,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316488275] [2020-12-23 16:34:50,902 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:34:50,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778684236] [2020-12-23 16:34:50,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:34:50,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-12-23 16:34:50,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470858170] [2020-12-23 16:34:50,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 16:34:50,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:34:50,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 16:34:50,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 16:34:50,905 INFO L87 Difference]: Start difference. First operand 432 states and 521 transitions. Second operand 6 states. [2020-12-23 16:34:51,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:34:51,018 INFO L93 Difference]: Finished difference Result 819 states and 999 transitions. [2020-12-23 16:34:51,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 16:34:51,019 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 230 [2020-12-23 16:34:51,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:34:51,022 INFO L225 Difference]: With dead ends: 819 [2020-12-23 16:34:51,022 INFO L226 Difference]: Without dead ends: 440 [2020-12-23 16:34:51,023 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 16:34:51,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-12-23 16:34:51,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2020-12-23 16:34:51,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-12-23 16:34:51,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 529 transitions. [2020-12-23 16:34:51,043 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 529 transitions. Word has length 230 [2020-12-23 16:34:51,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:34:51,043 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 529 transitions. [2020-12-23 16:34:51,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 16:34:51,043 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 529 transitions. [2020-12-23 16:34:51,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-12-23 16:34:51,047 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:34:51,047 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:34:51,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-12-23 16:34:51,261 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:34:51,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:34:51,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1844438796, now seen corresponding path program 2 times [2020-12-23 16:34:51,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:34:51,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542940872] [2020-12-23 16:34:51,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:34:51,300 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:34:51,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [708939364] [2020-12-23 16:34:51,301 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:34:51,808 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 16:34:51,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:34:51,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-23 16:34:51,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:34:52,051 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2020-12-23 16:34:52,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542940872] [2020-12-23 16:34:52,052 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:34:52,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708939364] [2020-12-23 16:34:52,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:34:52,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-12-23 16:34:52,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120150337] [2020-12-23 16:34:52,053 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 16:34:52,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:34:52,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 16:34:52,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-23 16:34:52,054 INFO L87 Difference]: Start difference. First operand 440 states and 529 transitions. Second operand 7 states. [2020-12-23 16:34:52,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:34:52,174 INFO L93 Difference]: Finished difference Result 834 states and 1014 transitions. [2020-12-23 16:34:52,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 16:34:52,175 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 234 [2020-12-23 16:34:52,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:34:52,178 INFO L225 Difference]: With dead ends: 834 [2020-12-23 16:34:52,178 INFO L226 Difference]: Without dead ends: 448 [2020-12-23 16:34:52,179 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-23 16:34:52,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2020-12-23 16:34:52,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2020-12-23 16:34:52,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2020-12-23 16:34:52,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 537 transitions. [2020-12-23 16:34:52,199 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 537 transitions. Word has length 234 [2020-12-23 16:34:52,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:34:52,199 INFO L481 AbstractCegarLoop]: Abstraction has 448 states and 537 transitions. [2020-12-23 16:34:52,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 16:34:52,199 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 537 transitions. [2020-12-23 16:34:52,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2020-12-23 16:34:52,201 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:34:52,201 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:34:52,416 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-12-23 16:34:52,417 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:34:52,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:34:52,418 INFO L82 PathProgramCache]: Analyzing trace with hash 951531638, now seen corresponding path program 3 times [2020-12-23 16:34:52,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:34:52,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947792804] [2020-12-23 16:34:52,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:34:52,440 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:34:52,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [889996557] [2020-12-23 16:34:52,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true