/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 16:34:04,565 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 16:34:04,568 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 16:34:04,602 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 16:34:04,602 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 16:34:04,604 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 16:34:04,605 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 16:34:04,608 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 16:34:04,618 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 16:34:04,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 16:34:04,620 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 16:34:04,622 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 16:34:04,622 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 16:34:04,623 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 16:34:04,624 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 16:34:04,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 16:34:04,627 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 16:34:04,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 16:34:04,630 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 16:34:04,632 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 16:34:04,634 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 16:34:04,635 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 16:34:04,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 16:34:04,638 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 16:34:04,641 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 16:34:04,641 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 16:34:04,642 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 16:34:04,643 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 16:34:04,643 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 16:34:04,644 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 16:34:04,645 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 16:34:04,646 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 16:34:04,646 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 16:34:04,647 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 16:34:04,649 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 16:34:04,649 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 16:34:04,650 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 16:34:04,650 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 16:34:04,650 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 16:34:04,651 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 16:34:04,652 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 16:34:04,655 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 16:34:04,701 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 16:34:04,701 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 16:34:04,703 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 16:34:04,703 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 16:34:04,703 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 16:34:04,703 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 16:34:04,704 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 16:34:04,704 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 16:34:04,704 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 16:34:04,704 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 16:34:04,704 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 16:34:04,704 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 16:34:04,705 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 16:34:04,705 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 16:34:04,705 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 16:34:04,705 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 16:34:04,705 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 16:34:04,706 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 16:34:04,706 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 16:34:04,706 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 16:34:04,706 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 16:34:04,706 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 16:34:04,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 16:34:04,707 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 16:34:04,707 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 16:34:04,707 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 16:34:05,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 16:34:05,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 16:34:05,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 16:34:05,197 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 16:34:05,197 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 16:34:05,198 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i [2020-12-23 16:34:05,265 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/80a99f36e/69d91ca67d914acca4925a952715f889/FLAGd49ff075e [2020-12-23 16:34:06,065 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 16:34:06,066 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i [2020-12-23 16:34:06,092 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/80a99f36e/69d91ca67d914acca4925a952715f889/FLAGd49ff075e [2020-12-23 16:34:06,207 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/80a99f36e/69d91ca67d914acca4925a952715f889 [2020-12-23 16:34:06,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 16:34:06,213 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 16:34:06,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 16:34:06,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 16:34:06,218 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 16:34:06,219 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 04:34:06" (1/1) ... [2020-12-23 16:34:06,220 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eb462e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:34:06, skipping insertion in model container [2020-12-23 16:34:06,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 04:34:06" (1/1) ... [2020-12-23 16:34:06,229 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 16:34:06,285 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 16:34:06,669 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.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,] [2020-12-23 16:34:06,834 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 16:34:06,854 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 16:34:06,920 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.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,] [2020-12-23 16:34:07,075 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 16:34:07,180 INFO L208 MainTranslator]: Completed translation [2020-12-23 16:34:07,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:34:07 WrapperNode [2020-12-23 16:34:07,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 16:34:07,183 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 16:34:07,183 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 16:34:07,183 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 16:34:07,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:34:07" (1/1) ... [2020-12-23 16:34:07,262 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:34:07" (1/1) ... [2020-12-23 16:34:07,378 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 16:34:07,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 16:34:07,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 16:34:07,381 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 16:34:07,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:34:07" (1/1) ... [2020-12-23 16:34:07,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:34:07" (1/1) ... [2020-12-23 16:34:07,423 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:34:07" (1/1) ... [2020-12-23 16:34:07,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:34:07" (1/1) ... [2020-12-23 16:34:07,501 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:34:07" (1/1) ... [2020-12-23 16:34:07,514 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:34:07" (1/1) ... [2020-12-23 16:34:07,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:34:07" (1/1) ... [2020-12-23 16:34:07,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 16:34:07,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 16:34:07,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 16:34:07,538 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 16:34:07,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:34:07" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 16:34:07,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 16:34:07,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 16:34:07,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 16:34:07,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 16:34:07,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 16:34:07,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 16:34:07,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 16:34:07,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 16:34:07,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 16:34:07,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 16:34:10,318 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 16:34:10,320 INFO L299 CfgBuilder]: Removed 98 assume(true) statements. [2020-12-23 16:34:10,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 04:34:10 BoogieIcfgContainer [2020-12-23 16:34:10,323 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 16:34:10,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 16:34:10,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 16:34:10,330 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 16:34:10,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 04:34:06" (1/3) ... [2020-12-23 16:34:10,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@613507a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 04:34:10, skipping insertion in model container [2020-12-23 16:34:10,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:34:07" (2/3) ... [2020-12-23 16:34:10,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@613507a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 04:34:10, skipping insertion in model container [2020-12-23 16:34:10,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 04:34:10" (3/3) ... [2020-12-23 16:34:10,335 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test4-1.i [2020-12-23 16:34:10,342 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 16:34:10,347 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2020-12-23 16:34:10,367 INFO L253 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2020-12-23 16:34:10,414 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 16:34:10,415 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 16:34:10,415 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 16:34:10,415 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 16:34:10,415 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 16:34:10,415 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 16:34:10,416 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 16:34:10,416 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 16:34:10,443 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states. [2020-12-23 16:34:10,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-23 16:34:10,448 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:34:10,449 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:34:10,450 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:34:10,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:34:10,455 INFO L82 PathProgramCache]: Analyzing trace with hash 889550569, now seen corresponding path program 1 times [2020-12-23 16:34:10,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:34:10,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102733425] [2020-12-23 16:34:10,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:34:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:34:10,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:34:10,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102733425] [2020-12-23 16:34:10,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:34:10,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 16:34:10,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709740750] [2020-12-23 16:34:10,629 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 16:34:10,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:34:10,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 16:34:10,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 16:34:10,646 INFO L87 Difference]: Start difference. First operand 221 states. Second operand 2 states. [2020-12-23 16:34:10,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:34:10,695 INFO L93 Difference]: Finished difference Result 440 states and 724 transitions. [2020-12-23 16:34:10,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 16:34:10,697 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2020-12-23 16:34:10,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:34:10,711 INFO L225 Difference]: With dead ends: 440 [2020-12-23 16:34:10,712 INFO L226 Difference]: Without dead ends: 217 [2020-12-23 16:34:10,717 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 16:34:10,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-12-23 16:34:10,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2020-12-23 16:34:10,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-12-23 16:34:10,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 282 transitions. [2020-12-23 16:34:10,811 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 282 transitions. Word has length 8 [2020-12-23 16:34:10,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:34:10,812 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 282 transitions. [2020-12-23 16:34:10,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 16:34:10,812 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 282 transitions. [2020-12-23 16:34:10,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-23 16:34:10,813 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:34:10,813 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:34:10,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 16:34:10,814 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:34:10,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:34:10,816 INFO L82 PathProgramCache]: Analyzing trace with hash 921152950, now seen corresponding path program 1 times [2020-12-23 16:34:10,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:34:10,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354543873] [2020-12-23 16:34:10,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:34:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:34:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:34:10,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354543873] [2020-12-23 16:34:10,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:34:10,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:34:10,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062903621] [2020-12-23 16:34:10,922 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:34:10,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:34:10,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:34:10,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:34:10,923 INFO L87 Difference]: Start difference. First operand 217 states and 282 transitions. Second operand 3 states. [2020-12-23 16:34:11,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:34:11,007 INFO L93 Difference]: Finished difference Result 432 states and 562 transitions. [2020-12-23 16:34:11,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:34:11,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-12-23 16:34:11,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:34:11,017 INFO L225 Difference]: With dead ends: 432 [2020-12-23 16:34:11,018 INFO L226 Difference]: Without dead ends: 387 [2020-12-23 16:34:11,021 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:34:11,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2020-12-23 16:34:11,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 218. [2020-12-23 16:34:11,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-12-23 16:34:11,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 283 transitions. [2020-12-23 16:34:11,064 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 283 transitions. Word has length 8 [2020-12-23 16:34:11,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:34:11,065 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 283 transitions. [2020-12-23 16:34:11,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:34:11,065 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 283 transitions. [2020-12-23 16:34:11,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 16:34:11,077 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:34:11,077 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:34:11,078 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 16:34:11,080 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:34:11,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:34:11,081 INFO L82 PathProgramCache]: Analyzing trace with hash -137963571, now seen corresponding path program 1 times [2020-12-23 16:34:11,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:34:11,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84247592] [2020-12-23 16:34:11,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:34:11,142 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:34:11,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [390884705] [2020-12-23 16:34:11,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:34:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:34:11,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:34:11,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:34:11,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:34:11,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84247592] [2020-12-23 16:34:11,624 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:34:11,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390884705] [2020-12-23 16:34:11,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:34:11,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:34:11,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301106647] [2020-12-23 16:34:11,627 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:34:11,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:34:11,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:34:11,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:34:11,631 INFO L87 Difference]: Start difference. First operand 218 states and 283 transitions. Second operand 3 states. [2020-12-23 16:34:11,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:34:11,776 INFO L93 Difference]: Finished difference Result 454 states and 594 transitions. [2020-12-23 16:34:11,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:34:11,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-12-23 16:34:11,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:34:11,783 INFO L225 Difference]: With dead ends: 454 [2020-12-23 16:34:11,783 INFO L226 Difference]: Without dead ends: 239 [2020-12-23 16:34:11,786 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:34:11,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-12-23 16:34:11,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 238. [2020-12-23 16:34:11,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2020-12-23 16:34:11,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 303 transitions. [2020-12-23 16:34:11,819 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 303 transitions. Word has length 106 [2020-12-23 16:34:11,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:34:11,822 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 303 transitions. [2020-12-23 16:34:11,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:34:11,822 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 303 transitions. [2020-12-23 16:34:11,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 16:34:11,830 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:34:11,831 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:34:12,046 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-12-23 16:34:12,047 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:34:12,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:34:12,048 INFO L82 PathProgramCache]: Analyzing trace with hash 62310097, now seen corresponding path program 1 times [2020-12-23 16:34:12,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:34:12,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794835345] [2020-12-23 16:34:12,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:34:12,104 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:34:12,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [487360107] [2020-12-23 16:34:12,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:34:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:34:12,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:34:12,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:34:12,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:34:12,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794835345] [2020-12-23 16:34:12,620 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:34:12,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487360107] [2020-12-23 16:34:12,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:34:12,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:34:12,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84150280] [2020-12-23 16:34:12,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:34:12,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:34:12,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:34:12,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:34:12,623 INFO L87 Difference]: Start difference. First operand 238 states and 303 transitions. Second operand 3 states. [2020-12-23 16:34:12,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:34:12,729 INFO L93 Difference]: Finished difference Result 494 states and 634 transitions. [2020-12-23 16:34:12,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:34:12,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-12-23 16:34:12,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:34:12,731 INFO L225 Difference]: With dead ends: 494 [2020-12-23 16:34:12,731 INFO L226 Difference]: Without dead ends: 259 [2020-12-23 16:34:12,732 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:34:12,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2020-12-23 16:34:12,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 258. [2020-12-23 16:34:12,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2020-12-23 16:34:12,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 323 transitions. [2020-12-23 16:34:12,743 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 323 transitions. Word has length 106 [2020-12-23 16:34:12,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:34:12,743 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 323 transitions. [2020-12-23 16:34:12,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:34:12,744 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 323 transitions. [2020-12-23 16:34:12,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 16:34:12,747 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:34:12,747 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:34:12,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:34:12,963 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:34:12,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:34:12,964 INFO L82 PathProgramCache]: Analyzing trace with hash -426500019, now seen corresponding path program 1 times [2020-12-23 16:34:12,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:34:12,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384087263] [2020-12-23 16:34:12,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:34:12,988 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:34:12,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1301324669] [2020-12-23 16:34:12,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:34:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:34:13,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:34:13,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:34:13,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:34:13,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384087263] [2020-12-23 16:34:13,405 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:34:13,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301324669] [2020-12-23 16:34:13,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:34:13,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 16:34:13,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94077498] [2020-12-23 16:34:13,407 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:34:13,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:34:13,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:34:13,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:34:13,408 INFO L87 Difference]: Start difference. First operand 258 states and 323 transitions. Second operand 4 states. [2020-12-23 16:34:13,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:34:13,500 INFO L93 Difference]: Finished difference Result 505 states and 635 transitions. [2020-12-23 16:34:13,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:34:13,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2020-12-23 16:34:13,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:34:13,502 INFO L225 Difference]: With dead ends: 505 [2020-12-23 16:34:13,502 INFO L226 Difference]: Without dead ends: 250 [2020-12-23 16:34:13,503 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:34:13,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-12-23 16:34:13,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 244. [2020-12-23 16:34:13,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2020-12-23 16:34:13,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 302 transitions. [2020-12-23 16:34:13,510 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 302 transitions. Word has length 106 [2020-12-23 16:34:13,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:34:13,510 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 302 transitions. [2020-12-23 16:34:13,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:34:13,510 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 302 transitions. [2020-12-23 16:34:13,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 16:34:13,512 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:34:13,512 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:34:13,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:34:13,726 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:34:13,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:34:13,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1791075329, now seen corresponding path program 1 times [2020-12-23 16:34:13,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:34:13,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539835912] [2020-12-23 16:34:13,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:34:13,748 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:34:13,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1412505413] [2020-12-23 16:34:13,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:34:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:34:14,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:34:14,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:34:14,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:34:14,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539835912] [2020-12-23 16:34:14,123 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:34:14,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412505413] [2020-12-23 16:34:14,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:34:14,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 16:34:14,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528454938] [2020-12-23 16:34:14,124 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:34:14,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:34:14,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:34:14,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:34:14,125 INFO L87 Difference]: Start difference. First operand 244 states and 302 transitions. Second operand 4 states. [2020-12-23 16:34:14,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:34:14,210 INFO L93 Difference]: Finished difference Result 566 states and 702 transitions. [2020-12-23 16:34:14,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:34:14,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2020-12-23 16:34:14,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:34:14,213 INFO L225 Difference]: With dead ends: 566 [2020-12-23 16:34:14,214 INFO L226 Difference]: Without dead ends: 325 [2020-12-23 16:34:14,215 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:34:14,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-12-23 16:34:14,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 230. [2020-12-23 16:34:14,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-12-23 16:34:14,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 281 transitions. [2020-12-23 16:34:14,223 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 281 transitions. Word has length 106 [2020-12-23 16:34:14,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:34:14,224 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 281 transitions. [2020-12-23 16:34:14,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:34:14,224 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 281 transitions. [2020-12-23 16:34:14,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 16:34:14,225 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:34:14,225 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:34:14,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:34:14,440 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:34:14,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:34:14,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1369189005, now seen corresponding path program 1 times [2020-12-23 16:34:14,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:34:14,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498181943] [2020-12-23 16:34:14,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:34:14,462 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:34:14,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1187526604] [2020-12-23 16:34:14,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:34:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:34:14,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:34:14,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:34:14,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:34:14,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498181943] [2020-12-23 16:34:14,861 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:34:14,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187526604] [2020-12-23 16:34:14,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:34:14,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-12-23 16:34:14,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926838414] [2020-12-23 16:34:14,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:34:14,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:34:14,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:34:14,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:34:14,863 INFO L87 Difference]: Start difference. First operand 230 states and 281 transitions. Second operand 4 states. [2020-12-23 16:34:14,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:34:14,904 INFO L93 Difference]: Finished difference Result 638 states and 780 transitions. [2020-12-23 16:34:14,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:34:14,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2020-12-23 16:34:14,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:34:14,908 INFO L225 Difference]: With dead ends: 638 [2020-12-23 16:34:14,908 INFO L226 Difference]: Without dead ends: 593 [2020-12-23 16:34:14,909 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:34:14,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-12-23 16:34:14,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 412. [2020-12-23 16:34:14,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2020-12-23 16:34:14,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 503 transitions. [2020-12-23 16:34:14,925 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 503 transitions. Word has length 106 [2020-12-23 16:34:14,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:34:14,925 INFO L481 AbstractCegarLoop]: Abstraction has 412 states and 503 transitions. [2020-12-23 16:34:14,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:34:14,926 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 503 transitions. [2020-12-23 16:34:14,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2020-12-23 16:34:14,928 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:34:14,928 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:34:15,142 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-23 16:34:15,143 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:34:15,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:34:15,144 INFO L82 PathProgramCache]: Analyzing trace with hash 548829604, now seen corresponding path program 2 times [2020-12-23 16:34:15,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:34:15,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124944445] [2020-12-23 16:34:15,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:34:15,170 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:34:15,170 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [48044116] [2020-12-23 16:34:15,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:34:15,372 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 16:34:15,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:34:15,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-23 16:34:15,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:34:15,768 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-12-23 16:34:15,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124944445] [2020-12-23 16:34:15,769 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:34:15,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48044116] [2020-12-23 16:34:15,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:34:15,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 16:34:15,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18485642] [2020-12-23 16:34:15,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:34:15,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:34:15,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:34:15,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:34:15,772 INFO L87 Difference]: Start difference. First operand 412 states and 503 transitions. Second operand 4 states. [2020-12-23 16:34:16,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:34:16,122 INFO L93 Difference]: Finished difference Result 677 states and 831 transitions. [2020-12-23 16:34:16,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:34:16,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2020-12-23 16:34:16,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:34:16,125 INFO L225 Difference]: With dead ends: 677 [2020-12-23 16:34:16,125 INFO L226 Difference]: Without dead ends: 410 [2020-12-23 16:34:16,126 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:34:16,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2020-12-23 16:34:16,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2020-12-23 16:34:16,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2020-12-23 16:34:16,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 500 transitions. [2020-12-23 16:34:16,139 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 500 transitions. Word has length 204 [2020-12-23 16:34:16,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:34:16,139 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 500 transitions. [2020-12-23 16:34:16,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:34:16,140 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 500 transitions. [2020-12-23 16:34:16,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2020-12-23 16:34:16,143 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:34:16,143 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:34:16,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:34:16,357 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:34:16,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:34:16,359 INFO L82 PathProgramCache]: Analyzing trace with hash -7696284, now seen corresponding path program 1 times [2020-12-23 16:34:16,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:34:16,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549397932] [2020-12-23 16:34:16,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:34:16,381 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:34:16,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1010428478] [2020-12-23 16:34:16,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:34:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:34:16,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:34:16,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:34:16,986 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-23 16:34:16,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549397932] [2020-12-23 16:34:16,987 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:34:16,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010428478] [2020-12-23 16:34:16,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:34:16,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:34:16,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237594988] [2020-12-23 16:34:16,988 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:34:16,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:34:16,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:34:16,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:34:16,990 INFO L87 Difference]: Start difference. First operand 410 states and 500 transitions. Second operand 3 states. [2020-12-23 16:34:17,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:34:17,051 INFO L93 Difference]: Finished difference Result 776 states and 957 transitions. [2020-12-23 16:34:17,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:34:17,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2020-12-23 16:34:17,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:34:17,054 INFO L225 Difference]: With dead ends: 776 [2020-12-23 16:34:17,054 INFO L226 Difference]: Without dead ends: 418 [2020-12-23 16:34:17,055 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:34:17,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2020-12-23 16:34:17,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2020-12-23 16:34:17,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-12-23 16:34:17,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 508 transitions. [2020-12-23 16:34:17,069 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 508 transitions. Word has length 211 [2020-12-23 16:34:17,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:34:17,070 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 508 transitions. [2020-12-23 16:34:17,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:34:17,070 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 508 transitions. [2020-12-23 16:34:17,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-12-23 16:34:17,073 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:34:17,073 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:34:17,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:34:17,287 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:34:17,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:34:17,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1887603621, now seen corresponding path program 1 times [2020-12-23 16:34:17,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:34:17,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198612730] [2020-12-23 16:34:17,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:34:17,328 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:34:17,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2073009155] [2020-12-23 16:34:17,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:34:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:34:17,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 16:34:17,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:34:17,912 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-12-23 16:34:17,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198612730] [2020-12-23 16:34:17,913 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:34:17,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073009155] [2020-12-23 16:34:17,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:34:17,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-12-23 16:34:17,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936834861] [2020-12-23 16:34:17,915 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:34:17,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:34:17,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:34:17,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:34:17,916 INFO L87 Difference]: Start difference. First operand 418 states and 508 transitions. Second operand 4 states. [2020-12-23 16:34:17,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:34:17,995 INFO L93 Difference]: Finished difference Result 791 states and 972 transitions. [2020-12-23 16:34:17,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:34:17,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2020-12-23 16:34:17,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:34:17,998 INFO L225 Difference]: With dead ends: 791 [2020-12-23 16:34:17,999 INFO L226 Difference]: Without dead ends: 426 [2020-12-23 16:34:18,000 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:34:18,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2020-12-23 16:34:18,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2020-12-23 16:34:18,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2020-12-23 16:34:18,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 516 transitions. [2020-12-23 16:34:18,013 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 516 transitions. Word has length 213 [2020-12-23 16:34:18,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:34:18,013 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 516 transitions. [2020-12-23 16:34:18,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:34:18,014 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 516 transitions. [2020-12-23 16:34:18,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-12-23 16:34:18,017 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:34:18,017 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:34:18,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-23 16:34:18,232 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:34:18,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:34:18,233 INFO L82 PathProgramCache]: Analyzing trace with hash -546185468, now seen corresponding path program 2 times [2020-12-23 16:34:18,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:34:18,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410342637] [2020-12-23 16:34:18,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:34:18,255 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:34:18,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1702271594] [2020-12-23 16:34:18,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:34:18,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 16:34:18,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:34:18,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 16:34:18,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:34:18,837 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 84 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-12-23 16:34:18,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410342637] [2020-12-23 16:34:18,838 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:34:18,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702271594] [2020-12-23 16:34:18,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:34:18,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-12-23 16:34:18,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502762658] [2020-12-23 16:34:18,839 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 16:34:18,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:34:18,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 16:34:18,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:34:18,839 INFO L87 Difference]: Start difference. First operand 426 states and 516 transitions. Second operand 5 states. [2020-12-23 16:34:18,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:34:18,920 INFO L93 Difference]: Finished difference Result 806 states and 987 transitions. [2020-12-23 16:34:18,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 16:34:18,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 215 [2020-12-23 16:34:18,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:34:18,923 INFO L225 Difference]: With dead ends: 806 [2020-12-23 16:34:18,923 INFO L226 Difference]: Without dead ends: 434 [2020-12-23 16:34:18,924 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:34:18,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-12-23 16:34:18,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2020-12-23 16:34:18,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-12-23 16:34:18,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 524 transitions. [2020-12-23 16:34:18,939 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 524 transitions. Word has length 215 [2020-12-23 16:34:18,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:34:18,939 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 524 transitions. [2020-12-23 16:34:18,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 16:34:18,940 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 524 transitions. [2020-12-23 16:34:18,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2020-12-23 16:34:18,943 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:34:18,943 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:34:19,157 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:34:19,158 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:34:19,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:34:19,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1962229253, now seen corresponding path program 3 times [2020-12-23 16:34:19,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:34:19,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506610527] [2020-12-23 16:34:19,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:34:19,240 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:34:19,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [162366921] [2020-12-23 16:34:19,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:34:19,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-23 16:34:19,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:34:19,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 16:34:19,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:34:19,834 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2020-12-23 16:34:19,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506610527] [2020-12-23 16:34:19,835 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:34:19,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162366921] [2020-12-23 16:34:19,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:34:19,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:34:19,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829126936] [2020-12-23 16:34:19,836 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:34:19,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:34:19,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:34:19,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:34:19,837 INFO L87 Difference]: Start difference. First operand 434 states and 524 transitions. Second operand 3 states. [2020-12-23 16:34:19,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:34:19,918 INFO L93 Difference]: Finished difference Result 804 states and 976 transitions. [2020-12-23 16:34:19,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:34:19,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2020-12-23 16:34:19,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:34:19,923 INFO L225 Difference]: With dead ends: 804 [2020-12-23 16:34:19,923 INFO L226 Difference]: Without dead ends: 432 [2020-12-23 16:34:19,924 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:34:19,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2020-12-23 16:34:19,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2020-12-23 16:34:19,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2020-12-23 16:34:19,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 521 transitions. [2020-12-23 16:34:19,941 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 521 transitions. Word has length 217 [2020-12-23 16:34:19,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:34:19,941 INFO L481 AbstractCegarLoop]: Abstraction has 432 states and 521 transitions. [2020-12-23 16:34:19,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:34:19,941 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 521 transitions. [2020-12-23 16:34:19,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2020-12-23 16:34:19,944 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:34:19,945 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:34:20,159 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:34:20,160 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:34:20,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:34:20,162 INFO L82 PathProgramCache]: Analyzing trace with hash -511436746, now seen corresponding path program 1 times [2020-12-23 16:34:20,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:34:20,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313979316] [2020-12-23 16:34:20,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:34:20,189 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:34:20,189 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1365284215] [2020-12-23 16:34:20,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:34:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:34:20,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-23 16:34:20,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:34:20,827 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-12-23 16:34:20,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313979316] [2020-12-23 16:34:20,827 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:34:20,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365284215] [2020-12-23 16:34:20,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:34:20,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-12-23 16:34:20,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153832845] [2020-12-23 16:34:20,829 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 16:34:20,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:34:20,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 16:34:20,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 16:34:20,830 INFO L87 Difference]: Start difference. First operand 432 states and 521 transitions. Second operand 6 states. [2020-12-23 16:34:20,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:34:20,935 INFO L93 Difference]: Finished difference Result 819 states and 999 transitions. [2020-12-23 16:34:20,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 16:34:20,935 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 230 [2020-12-23 16:34:20,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:34:20,938 INFO L225 Difference]: With dead ends: 819 [2020-12-23 16:34:20,938 INFO L226 Difference]: Without dead ends: 440 [2020-12-23 16:34:20,939 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 16:34:20,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-12-23 16:34:20,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2020-12-23 16:34:20,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-12-23 16:34:20,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 529 transitions. [2020-12-23 16:34:20,954 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 529 transitions. Word has length 230 [2020-12-23 16:34:20,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:34:20,955 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 529 transitions. [2020-12-23 16:34:20,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 16:34:20,955 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 529 transitions. [2020-12-23 16:34:20,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-12-23 16:34:20,958 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:34:20,959 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:34:21,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-12-23 16:34:21,173 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:34:21,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:34:21,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1844438796, now seen corresponding path program 2 times [2020-12-23 16:34:21,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:34:21,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608268967] [2020-12-23 16:34:21,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:34:21,193 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:34:21,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2079326985] [2020-12-23 16:34:21,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:34:21,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 16:34:21,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:34:21,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-23 16:34:21,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:34:21,902 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2020-12-23 16:34:21,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608268967] [2020-12-23 16:34:21,903 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:34:21,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079326985] [2020-12-23 16:34:21,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:34:21,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-12-23 16:34:21,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434722505] [2020-12-23 16:34:21,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 16:34:21,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:34:21,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 16:34:21,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-23 16:34:21,905 INFO L87 Difference]: Start difference. First operand 440 states and 529 transitions. Second operand 7 states. [2020-12-23 16:34:22,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:34:22,011 INFO L93 Difference]: Finished difference Result 834 states and 1014 transitions. [2020-12-23 16:34:22,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 16:34:22,011 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 234 [2020-12-23 16:34:22,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:34:22,014 INFO L225 Difference]: With dead ends: 834 [2020-12-23 16:34:22,014 INFO L226 Difference]: Without dead ends: 448 [2020-12-23 16:34:22,015 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-23 16:34:22,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2020-12-23 16:34:22,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2020-12-23 16:34:22,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2020-12-23 16:34:22,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 537 transitions. [2020-12-23 16:34:22,031 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 537 transitions. Word has length 234 [2020-12-23 16:34:22,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:34:22,031 INFO L481 AbstractCegarLoop]: Abstraction has 448 states and 537 transitions. [2020-12-23 16:34:22,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 16:34:22,031 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 537 transitions. [2020-12-23 16:34:22,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2020-12-23 16:34:22,033 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:34:22,033 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:34:22,246 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-12-23 16:34:22,247 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:34:22,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:34:22,248 INFO L82 PathProgramCache]: Analyzing trace with hash 951531638, now seen corresponding path program 3 times [2020-12-23 16:34:22,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:34:22,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479648444] [2020-12-23 16:34:22,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:34:22,268 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:34:22,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [799386765] [2020-12-23 16:34:22,269 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