/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 16:03:35,599 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 16:03:35,603 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 16:03:35,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 16:03:35,648 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 16:03:35,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 16:03:35,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 16:03:35,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 16:03:35,657 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 16:03:35,658 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 16:03:35,660 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 16:03:35,661 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 16:03:35,662 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 16:03:35,663 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 16:03:35,665 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 16:03:35,667 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 16:03:35,668 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 16:03:35,669 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 16:03:35,672 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 16:03:35,687 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 16:03:35,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 16:03:35,699 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 16:03:35,701 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 16:03:35,702 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 16:03:35,715 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 16:03:35,715 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 16:03:35,716 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 16:03:35,722 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 16:03:35,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 16:03:35,727 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 16:03:35,727 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 16:03:35,732 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 16:03:35,735 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 16:03:35,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 16:03:35,739 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 16:03:35,740 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 16:03:35,741 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 16:03:35,742 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 16:03:35,742 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 16:03:35,743 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 16:03:35,745 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 16:03:35,746 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:03:35,789 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 16:03:35,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 16:03:35,791 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 16:03:35,791 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 16:03:35,791 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 16:03:35,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 16:03:35,792 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 16:03:35,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 16:03:35,792 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 16:03:35,792 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 16:03:35,793 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 16:03:35,793 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 16:03:35,793 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 16:03:35,793 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 16:03:35,793 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 16:03:35,793 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 16:03:35,794 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 16:03:35,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 16:03:35,794 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 16:03:35,794 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 16:03:35,794 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 16:03:35,795 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 16:03:35,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 16:03:35,795 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 16:03:35,795 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 16:03:35,795 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:03:36,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 16:03:36,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 16:03:36,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 16:03:36,239 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 16:03:36,240 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 16:03:36,241 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-3.i [2020-12-23 16:03:36,345 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/71a281551/ad757cc39cb64ca8a4e87939424756af/FLAGbf79458cb [2020-12-23 16:03:37,197 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 16:03:37,198 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-3.i [2020-12-23 16:03:37,233 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/71a281551/ad757cc39cb64ca8a4e87939424756af/FLAGbf79458cb [2020-12-23 16:03:37,395 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/71a281551/ad757cc39cb64ca8a4e87939424756af [2020-12-23 16:03:37,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 16:03:37,401 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 16:03:37,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 16:03:37,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 16:03:37,410 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 16:03:37,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 04:03:37" (1/1) ... [2020-12-23 16:03:37,413 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dd11dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:03:37, skipping insertion in model container [2020-12-23 16:03:37,413 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 04:03:37" (1/1) ... [2020-12-23 16:03:37,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 16:03:37,510 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 16:03:37,977 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-3.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[~usertmp~0,] left hand side expression in assignment: lhs: VariableLHS[~userstmp~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]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem321,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem321,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem326,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem326,],offset],IdentifierExpression[#t~mem328,]]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem332,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem332,],offset],IdentifierExpression[#t~mem334,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~1,],base],StructAccessExpression[IdentifierExpression[~_hd_head~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem346,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem346,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem349,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem349,],offset]]]] [2020-12-23 16:03:38,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 16:03:38,251 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 16:03:38,395 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-3.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[~usertmp~0,] left hand side expression in assignment: lhs: VariableLHS[~userstmp~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]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem329,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem329,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem334,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem334,],offset],IdentifierExpression[#t~mem336,]]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem340,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem340,],offset],IdentifierExpression[#t~mem342,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~1,],base],StructAccessExpression[IdentifierExpression[~_hd_head~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem354,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem354,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem357,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem357,],offset]]]] [2020-12-23 16:03:38,518 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 16:03:38,611 INFO L208 MainTranslator]: Completed translation [2020-12-23 16:03:38,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:03:38 WrapperNode [2020-12-23 16:03:38,612 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 16:03:38,613 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 16:03:38,614 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 16:03:38,614 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 16:03:38,623 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:03:38" (1/1) ... [2020-12-23 16:03:38,676 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:03:38" (1/1) ... [2020-12-23 16:03:38,796 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 16:03:38,797 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 16:03:38,797 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 16:03:38,797 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 16:03:38,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:03:38" (1/1) ... [2020-12-23 16:03:38,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:03:38" (1/1) ... [2020-12-23 16:03:38,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:03:38" (1/1) ... [2020-12-23 16:03:38,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:03:38" (1/1) ... [2020-12-23 16:03:38,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:03:38" (1/1) ... [2020-12-23 16:03:39,013 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:03:38" (1/1) ... [2020-12-23 16:03:39,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:03:38" (1/1) ... [2020-12-23 16:03:39,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 16:03:39,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 16:03:39,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 16:03:39,065 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 16:03:39,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:03:38" (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:03:39,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 16:03:39,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 16:03:39,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 16:03:39,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 16:03:39,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 16:03:39,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 16:03:39,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 16:03:39,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 16:03:39,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 16:03:39,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 16:03:41,815 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 16:03:41,815 INFO L299 CfgBuilder]: Removed 115 assume(true) statements. [2020-12-23 16:03:41,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 04:03:41 BoogieIcfgContainer [2020-12-23 16:03:41,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 16:03:41,820 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 16:03:41,820 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 16:03:41,824 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 16:03:41,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 04:03:37" (1/3) ... [2020-12-23 16:03:41,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fec3853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 04:03:41, skipping insertion in model container [2020-12-23 16:03:41,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:03:38" (2/3) ... [2020-12-23 16:03:41,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fec3853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 04:03:41, skipping insertion in model container [2020-12-23 16:03:41,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 04:03:41" (3/3) ... [2020-12-23 16:03:41,828 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test4-3.i [2020-12-23 16:03:41,837 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 16:03:41,843 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2020-12-23 16:03:41,866 INFO L253 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2020-12-23 16:03:41,900 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 16:03:41,900 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 16:03:41,900 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 16:03:41,901 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 16:03:41,901 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 16:03:41,901 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 16:03:41,901 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 16:03:41,901 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 16:03:41,926 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states. [2020-12-23 16:03:41,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-23 16:03:41,933 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:03:41,934 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:03:41,935 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:03:41,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:03:41,942 INFO L82 PathProgramCache]: Analyzing trace with hash 889550569, now seen corresponding path program 1 times [2020-12-23 16:03:41,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:03:41,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113826054] [2020-12-23 16:03:41,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:03:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:03:42,142 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:03:42,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113826054] [2020-12-23 16:03:42,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:03:42,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 16:03:42,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629436981] [2020-12-23 16:03:42,152 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 16:03:42,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:03:42,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 16:03:42,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 16:03:42,178 INFO L87 Difference]: Start difference. First operand 271 states. Second operand 2 states. [2020-12-23 16:03:42,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:03:42,325 INFO L93 Difference]: Finished difference Result 540 states and 896 transitions. [2020-12-23 16:03:42,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 16:03:42,330 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2020-12-23 16:03:42,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:03:42,347 INFO L225 Difference]: With dead ends: 540 [2020-12-23 16:03:42,348 INFO L226 Difference]: Without dead ends: 217 [2020-12-23 16:03:42,354 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:03:42,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-12-23 16:03:42,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2020-12-23 16:03:42,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-12-23 16:03:42,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 282 transitions. [2020-12-23 16:03:42,413 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 282 transitions. Word has length 8 [2020-12-23 16:03:42,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:03:42,414 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 282 transitions. [2020-12-23 16:03:42,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 16:03:42,414 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 282 transitions. [2020-12-23 16:03:42,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-23 16:03:42,415 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:03:42,415 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:03:42,416 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 16:03:42,416 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:03:42,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:03:42,417 INFO L82 PathProgramCache]: Analyzing trace with hash 921152950, now seen corresponding path program 1 times [2020-12-23 16:03:42,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:03:42,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004706204] [2020-12-23 16:03:42,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:03:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:03:42,480 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:03:42,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004706204] [2020-12-23 16:03:42,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:03:42,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:03:42,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224949189] [2020-12-23 16:03:42,483 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:03:42,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:03:42,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:03:42,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:03:42,485 INFO L87 Difference]: Start difference. First operand 217 states and 282 transitions. Second operand 3 states. [2020-12-23 16:03:42,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:03:42,534 INFO L93 Difference]: Finished difference Result 432 states and 562 transitions. [2020-12-23 16:03:42,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:03:42,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-12-23 16:03:42,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:03:42,539 INFO L225 Difference]: With dead ends: 432 [2020-12-23 16:03:42,539 INFO L226 Difference]: Without dead ends: 387 [2020-12-23 16:03:42,541 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:03:42,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2020-12-23 16:03:42,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 218. [2020-12-23 16:03:42,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-12-23 16:03:42,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 283 transitions. [2020-12-23 16:03:42,562 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 283 transitions. Word has length 8 [2020-12-23 16:03:42,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:03:42,562 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 283 transitions. [2020-12-23 16:03:42,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:03:42,563 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 283 transitions. [2020-12-23 16:03:42,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 16:03:42,568 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:03:42,568 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:03:42,568 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 16:03:42,569 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:03:42,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:03:42,570 INFO L82 PathProgramCache]: Analyzing trace with hash -137963571, now seen corresponding path program 1 times [2020-12-23 16:03:42,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:03:42,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453898815] [2020-12-23 16:03:42,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:03:42,603 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:03:42,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1957749012] [2020-12-23 16:03:42,604 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:03:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:03:42,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:03:43,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:03:43,229 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:03:43,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453898815] [2020-12-23 16:03:43,230 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:03:43,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957749012] [2020-12-23 16:03:43,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:03:43,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:03:43,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966788744] [2020-12-23 16:03:43,235 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:03:43,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:03:43,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:03:43,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:03:43,237 INFO L87 Difference]: Start difference. First operand 218 states and 283 transitions. Second operand 3 states. [2020-12-23 16:03:43,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:03:43,390 INFO L93 Difference]: Finished difference Result 454 states and 594 transitions. [2020-12-23 16:03:43,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:03:43,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-12-23 16:03:43,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:03:43,397 INFO L225 Difference]: With dead ends: 454 [2020-12-23 16:03:43,397 INFO L226 Difference]: Without dead ends: 239 [2020-12-23 16:03:43,400 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:03:43,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-12-23 16:03:43,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 238. [2020-12-23 16:03:43,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2020-12-23 16:03:43,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 303 transitions. [2020-12-23 16:03:43,437 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 303 transitions. Word has length 106 [2020-12-23 16:03:43,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:03:43,441 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 303 transitions. [2020-12-23 16:03:43,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:03:43,441 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 303 transitions. [2020-12-23 16:03:43,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 16:03:43,453 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:03:43,454 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:03:43,654 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-12-23 16:03:43,656 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:03:43,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:03:43,657 INFO L82 PathProgramCache]: Analyzing trace with hash 62310097, now seen corresponding path program 1 times [2020-12-23 16:03:43,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:03:43,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049360668] [2020-12-23 16:03:43,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:03:43,719 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:03:43,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1924825607] [2020-12-23 16:03:43,720 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:03:44,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:03:44,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:03:44,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:03:44,220 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:03:44,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049360668] [2020-12-23 16:03:44,221 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:03:44,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924825607] [2020-12-23 16:03:44,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:03:44,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:03:44,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329411724] [2020-12-23 16:03:44,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:03:44,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:03:44,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:03:44,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:03:44,223 INFO L87 Difference]: Start difference. First operand 238 states and 303 transitions. Second operand 3 states. [2020-12-23 16:03:44,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:03:44,319 INFO L93 Difference]: Finished difference Result 494 states and 634 transitions. [2020-12-23 16:03:44,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:03:44,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-12-23 16:03:44,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:03:44,322 INFO L225 Difference]: With dead ends: 494 [2020-12-23 16:03:44,322 INFO L226 Difference]: Without dead ends: 259 [2020-12-23 16:03:44,323 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:03:44,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2020-12-23 16:03:44,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 258. [2020-12-23 16:03:44,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2020-12-23 16:03:44,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 323 transitions. [2020-12-23 16:03:44,333 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 323 transitions. Word has length 106 [2020-12-23 16:03:44,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:03:44,333 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 323 transitions. [2020-12-23 16:03:44,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:03:44,334 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 323 transitions. [2020-12-23 16:03:44,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 16:03:44,337 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:03:44,338 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:03:44,550 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:03:44,552 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:03:44,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:03:44,553 INFO L82 PathProgramCache]: Analyzing trace with hash -426500019, now seen corresponding path program 1 times [2020-12-23 16:03:44,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:03:44,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660460086] [2020-12-23 16:03:44,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:03:44,578 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:03:44,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [930910345] [2020-12-23 16:03:44,579 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:03:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:03:44,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:03:44,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:03:45,081 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:03:45,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660460086] [2020-12-23 16:03:45,082 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:03:45,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930910345] [2020-12-23 16:03:45,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:03:45,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 16:03:45,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467391560] [2020-12-23 16:03:45,086 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:03:45,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:03:45,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:03:45,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:03:45,087 INFO L87 Difference]: Start difference. First operand 258 states and 323 transitions. Second operand 4 states. [2020-12-23 16:03:45,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:03:45,190 INFO L93 Difference]: Finished difference Result 505 states and 635 transitions. [2020-12-23 16:03:45,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:03:45,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2020-12-23 16:03:45,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:03:45,192 INFO L225 Difference]: With dead ends: 505 [2020-12-23 16:03:45,192 INFO L226 Difference]: Without dead ends: 250 [2020-12-23 16:03:45,193 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:03:45,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-12-23 16:03:45,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 244. [2020-12-23 16:03:45,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2020-12-23 16:03:45,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 302 transitions. [2020-12-23 16:03:45,202 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 302 transitions. Word has length 106 [2020-12-23 16:03:45,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:03:45,202 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 302 transitions. [2020-12-23 16:03:45,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:03:45,202 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 302 transitions. [2020-12-23 16:03:45,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 16:03:45,204 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:03:45,204 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:03:45,418 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:03:45,419 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:03:45,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:03:45,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1791075329, now seen corresponding path program 1 times [2020-12-23 16:03:45,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:03:45,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104208561] [2020-12-23 16:03:45,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:03:45,446 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:03:45,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1156916890] [2020-12-23 16:03:45,447 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:03:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:03:45,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:03:45,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:03:45,887 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:03:45,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104208561] [2020-12-23 16:03:45,888 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:03:45,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156916890] [2020-12-23 16:03:45,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:03:45,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 16:03:45,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228227458] [2020-12-23 16:03:45,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:03:45,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:03:45,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:03:45,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:03:45,891 INFO L87 Difference]: Start difference. First operand 244 states and 302 transitions. Second operand 4 states. [2020-12-23 16:03:45,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:03:45,990 INFO L93 Difference]: Finished difference Result 566 states and 702 transitions. [2020-12-23 16:03:45,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:03:45,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2020-12-23 16:03:45,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:03:45,993 INFO L225 Difference]: With dead ends: 566 [2020-12-23 16:03:45,993 INFO L226 Difference]: Without dead ends: 325 [2020-12-23 16:03:45,994 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:03:45,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-12-23 16:03:46,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 230. [2020-12-23 16:03:46,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-12-23 16:03:46,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 281 transitions. [2020-12-23 16:03:46,007 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 281 transitions. Word has length 106 [2020-12-23 16:03:46,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:03:46,007 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 281 transitions. [2020-12-23 16:03:46,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:03:46,008 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 281 transitions. [2020-12-23 16:03:46,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 16:03:46,009 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:03:46,009 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:03:46,223 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:03:46,224 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:03:46,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:03:46,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1369189005, now seen corresponding path program 1 times [2020-12-23 16:03:46,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:03:46,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875533584] [2020-12-23 16:03:46,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:03:46,249 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:03:46,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [464401869] [2020-12-23 16:03:46,255 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:03:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:03:46,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:03:46,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:03:46,714 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:03:46,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875533584] [2020-12-23 16:03:46,714 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:03:46,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464401869] [2020-12-23 16:03:46,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:03:46,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-12-23 16:03:46,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158769398] [2020-12-23 16:03:46,716 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:03:46,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:03:46,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:03:46,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:03:46,717 INFO L87 Difference]: Start difference. First operand 230 states and 281 transitions. Second operand 4 states. [2020-12-23 16:03:46,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:03:46,765 INFO L93 Difference]: Finished difference Result 638 states and 780 transitions. [2020-12-23 16:03:46,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:03:46,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2020-12-23 16:03:46,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:03:46,771 INFO L225 Difference]: With dead ends: 638 [2020-12-23 16:03:46,771 INFO L226 Difference]: Without dead ends: 593 [2020-12-23 16:03:46,772 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:03:46,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-12-23 16:03:46,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 412. [2020-12-23 16:03:46,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2020-12-23 16:03:46,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 503 transitions. [2020-12-23 16:03:46,790 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 503 transitions. Word has length 106 [2020-12-23 16:03:46,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:03:46,790 INFO L481 AbstractCegarLoop]: Abstraction has 412 states and 503 transitions. [2020-12-23 16:03:46,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:03:46,791 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 503 transitions. [2020-12-23 16:03:46,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2020-12-23 16:03:46,794 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:03:46,794 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:03:47,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-23 16:03:47,009 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:03:47,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:03:47,010 INFO L82 PathProgramCache]: Analyzing trace with hash 548829604, now seen corresponding path program 2 times [2020-12-23 16:03:47,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:03:47,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221467960] [2020-12-23 16:03:47,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:03:47,035 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:03:47,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [756376974] [2020-12-23 16:03:47,036 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:03:47,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 16:03:47,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:03:47,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-23 16:03:47,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:03:47,727 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:03:47,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221467960] [2020-12-23 16:03:47,728 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:03:47,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756376974] [2020-12-23 16:03:47,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:03:47,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 16:03:47,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80088075] [2020-12-23 16:03:47,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:03:47,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:03:47,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:03:47,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:03:47,731 INFO L87 Difference]: Start difference. First operand 412 states and 503 transitions. Second operand 4 states. [2020-12-23 16:03:48,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:03:48,213 INFO L93 Difference]: Finished difference Result 677 states and 831 transitions. [2020-12-23 16:03:48,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:03:48,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2020-12-23 16:03:48,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:03:48,216 INFO L225 Difference]: With dead ends: 677 [2020-12-23 16:03:48,217 INFO L226 Difference]: Without dead ends: 410 [2020-12-23 16:03:48,218 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:03:48,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2020-12-23 16:03:48,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2020-12-23 16:03:48,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2020-12-23 16:03:48,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 500 transitions. [2020-12-23 16:03:48,236 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 500 transitions. Word has length 204 [2020-12-23 16:03:48,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:03:48,237 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 500 transitions. [2020-12-23 16:03:48,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:03:48,237 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 500 transitions. [2020-12-23 16:03:48,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2020-12-23 16:03:48,240 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:03:48,241 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:03:48,455 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:03:48,456 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:03:48,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:03:48,457 INFO L82 PathProgramCache]: Analyzing trace with hash -7696284, now seen corresponding path program 1 times [2020-12-23 16:03:48,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:03:48,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900480400] [2020-12-23 16:03:48,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:03:48,485 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:03:48,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2111549582] [2020-12-23 16:03:48,486 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:03:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:03:48,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:03:48,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:03:49,159 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:03:49,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900480400] [2020-12-23 16:03:49,159 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:03:49,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111549582] [2020-12-23 16:03:49,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:03:49,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:03:49,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992148002] [2020-12-23 16:03:49,161 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:03:49,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:03:49,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:03:49,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:03:49,162 INFO L87 Difference]: Start difference. First operand 410 states and 500 transitions. Second operand 3 states. [2020-12-23 16:03:49,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:03:49,232 INFO L93 Difference]: Finished difference Result 776 states and 957 transitions. [2020-12-23 16:03:49,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:03:49,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2020-12-23 16:03:49,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:03:49,236 INFO L225 Difference]: With dead ends: 776 [2020-12-23 16:03:49,236 INFO L226 Difference]: Without dead ends: 418 [2020-12-23 16:03:49,237 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:03:49,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2020-12-23 16:03:49,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2020-12-23 16:03:49,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-12-23 16:03:49,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 508 transitions. [2020-12-23 16:03:49,253 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 508 transitions. Word has length 211 [2020-12-23 16:03:49,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:03:49,254 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 508 transitions. [2020-12-23 16:03:49,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:03:49,254 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 508 transitions. [2020-12-23 16:03:49,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-12-23 16:03:49,257 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:03:49,258 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:03:49,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:03:49,472 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:03:49,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:03:49,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1887603621, now seen corresponding path program 1 times [2020-12-23 16:03:49,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:03:49,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857929754] [2020-12-23 16:03:49,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:03:49,506 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:03:49,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1210131312] [2020-12-23 16:03:49,507 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:03:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:03:49,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 16:03:49,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:03:50,167 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:03:50,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857929754] [2020-12-23 16:03:50,168 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:03:50,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210131312] [2020-12-23 16:03:50,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:03:50,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-12-23 16:03:50,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079626266] [2020-12-23 16:03:50,174 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:03:50,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:03:50,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:03:50,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:03:50,178 INFO L87 Difference]: Start difference. First operand 418 states and 508 transitions. Second operand 4 states. [2020-12-23 16:03:50,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:03:50,264 INFO L93 Difference]: Finished difference Result 791 states and 972 transitions. [2020-12-23 16:03:50,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:03:50,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2020-12-23 16:03:50,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:03:50,267 INFO L225 Difference]: With dead ends: 791 [2020-12-23 16:03:50,267 INFO L226 Difference]: Without dead ends: 426 [2020-12-23 16:03:50,268 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:03:50,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2020-12-23 16:03:50,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2020-12-23 16:03:50,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2020-12-23 16:03:50,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 516 transitions. [2020-12-23 16:03:50,286 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 516 transitions. Word has length 213 [2020-12-23 16:03:50,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:03:50,286 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 516 transitions. [2020-12-23 16:03:50,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:03:50,286 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 516 transitions. [2020-12-23 16:03:50,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-12-23 16:03:50,289 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:03:50,290 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:03:50,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-23 16:03:50,505 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:03:50,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:03:50,506 INFO L82 PathProgramCache]: Analyzing trace with hash -546185468, now seen corresponding path program 2 times [2020-12-23 16:03:50,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:03:50,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924007524] [2020-12-23 16:03:50,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:03:50,533 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:03:50,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1679731680] [2020-12-23 16:03:50,534 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:03:50,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 16:03:50,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:03:50,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 16:03:50,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:03:51,219 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:03:51,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924007524] [2020-12-23 16:03:51,220 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:03:51,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679731680] [2020-12-23 16:03:51,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:03:51,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-12-23 16:03:51,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636667740] [2020-12-23 16:03:51,220 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 16:03:51,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:03:51,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 16:03:51,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:03:51,222 INFO L87 Difference]: Start difference. First operand 426 states and 516 transitions. Second operand 5 states. [2020-12-23 16:03:51,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:03:51,314 INFO L93 Difference]: Finished difference Result 806 states and 987 transitions. [2020-12-23 16:03:51,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 16:03:51,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 215 [2020-12-23 16:03:51,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:03:51,317 INFO L225 Difference]: With dead ends: 806 [2020-12-23 16:03:51,318 INFO L226 Difference]: Without dead ends: 434 [2020-12-23 16:03:51,319 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:03:51,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-12-23 16:03:51,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2020-12-23 16:03:51,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-12-23 16:03:51,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 524 transitions. [2020-12-23 16:03:51,336 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 524 transitions. Word has length 215 [2020-12-23 16:03:51,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:03:51,336 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 524 transitions. [2020-12-23 16:03:51,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 16:03:51,336 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 524 transitions. [2020-12-23 16:03:51,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2020-12-23 16:03:51,339 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:03:51,340 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:03:51,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:03:51,556 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:03:51,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:03:51,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1962229253, now seen corresponding path program 3 times [2020-12-23 16:03:51,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:03:51,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788835966] [2020-12-23 16:03:51,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:03:51,607 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:03:51,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [584461893] [2020-12-23 16:03:51,608 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:03:51,972 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-23 16:03:51,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:03:51,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 16:03:51,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:03:52,295 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:03:52,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788835966] [2020-12-23 16:03:52,296 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:03:52,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584461893] [2020-12-23 16:03:52,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:03:52,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:03:52,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299750576] [2020-12-23 16:03:52,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:03:52,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:03:52,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:03:52,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:03:52,298 INFO L87 Difference]: Start difference. First operand 434 states and 524 transitions. Second operand 3 states. [2020-12-23 16:03:52,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:03:52,367 INFO L93 Difference]: Finished difference Result 804 states and 976 transitions. [2020-12-23 16:03:52,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:03:52,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2020-12-23 16:03:52,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:03:52,373 INFO L225 Difference]: With dead ends: 804 [2020-12-23 16:03:52,373 INFO L226 Difference]: Without dead ends: 432 [2020-12-23 16:03:52,374 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:03:52,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2020-12-23 16:03:52,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2020-12-23 16:03:52,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2020-12-23 16:03:52,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 521 transitions. [2020-12-23 16:03:52,395 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 521 transitions. Word has length 217 [2020-12-23 16:03:52,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:03:52,395 INFO L481 AbstractCegarLoop]: Abstraction has 432 states and 521 transitions. [2020-12-23 16:03:52,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:03:52,395 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 521 transitions. [2020-12-23 16:03:52,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2020-12-23 16:03:52,398 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:03:52,398 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:03:52,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:03:52,613 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:03:52,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:03:52,614 INFO L82 PathProgramCache]: Analyzing trace with hash -511436746, now seen corresponding path program 1 times [2020-12-23 16:03:52,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:03:52,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034565524] [2020-12-23 16:03:52,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:03:52,639 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:03:52,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1036629246] [2020-12-23 16:03:52,640 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:03:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:03:53,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-23 16:03:53,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:03:53,412 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:03:53,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034565524] [2020-12-23 16:03:53,413 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:03:53,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036629246] [2020-12-23 16:03:53,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:03:53,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-12-23 16:03:53,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271115540] [2020-12-23 16:03:53,414 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 16:03:53,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:03:53,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 16:03:53,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 16:03:53,415 INFO L87 Difference]: Start difference. First operand 432 states and 521 transitions. Second operand 6 states. [2020-12-23 16:03:53,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:03:53,528 INFO L93 Difference]: Finished difference Result 819 states and 999 transitions. [2020-12-23 16:03:53,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 16:03:53,528 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 230 [2020-12-23 16:03:53,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:03:53,531 INFO L225 Difference]: With dead ends: 819 [2020-12-23 16:03:53,531 INFO L226 Difference]: Without dead ends: 440 [2020-12-23 16:03:53,532 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:03:53,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-12-23 16:03:53,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2020-12-23 16:03:53,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-12-23 16:03:53,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 529 transitions. [2020-12-23 16:03:53,576 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 529 transitions. Word has length 230 [2020-12-23 16:03:53,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:03:53,576 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 529 transitions. [2020-12-23 16:03:53,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 16:03:53,576 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 529 transitions. [2020-12-23 16:03:53,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-12-23 16:03:53,578 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:03:53,578 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:03:53,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-12-23 16:03:53,794 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:03:53,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:03:53,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1844438796, now seen corresponding path program 2 times [2020-12-23 16:03:53,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:03:53,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097266031] [2020-12-23 16:03:53,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:03:53,817 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:03:53,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1102714252] [2020-12-23 16:03:53,817 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:03:54,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 16:03:54,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:03:54,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-23 16:03:54,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:03:54,563 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:03:54,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097266031] [2020-12-23 16:03:54,563 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:03:54,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102714252] [2020-12-23 16:03:54,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:03:54,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-12-23 16:03:54,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778799120] [2020-12-23 16:03:54,564 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 16:03:54,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:03:54,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 16:03:54,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-23 16:03:54,565 INFO L87 Difference]: Start difference. First operand 440 states and 529 transitions. Second operand 7 states. [2020-12-23 16:03:54,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:03:54,691 INFO L93 Difference]: Finished difference Result 834 states and 1014 transitions. [2020-12-23 16:03:54,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 16:03:54,691 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 234 [2020-12-23 16:03:54,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:03:54,694 INFO L225 Difference]: With dead ends: 834 [2020-12-23 16:03:54,694 INFO L226 Difference]: Without dead ends: 448 [2020-12-23 16:03:54,695 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:03:54,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2020-12-23 16:03:54,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2020-12-23 16:03:54,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2020-12-23 16:03:54,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 537 transitions. [2020-12-23 16:03:54,713 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 537 transitions. Word has length 234 [2020-12-23 16:03:54,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:03:54,713 INFO L481 AbstractCegarLoop]: Abstraction has 448 states and 537 transitions. [2020-12-23 16:03:54,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 16:03:54,713 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 537 transitions. [2020-12-23 16:03:54,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2020-12-23 16:03:54,715 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:03:54,716 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:03:54,930 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-12-23 16:03:54,931 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:03:54,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:03:54,932 INFO L82 PathProgramCache]: Analyzing trace with hash 951531638, now seen corresponding path program 3 times [2020-12-23 16:03:54,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:03:54,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815980533] [2020-12-23 16:03:54,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:03:54,954 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:03:54,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2047545453] [2020-12-23 16:03:54,955 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