/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_BER_test5-3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 15:58:11,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 15:58:11,075 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 15:58:11,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 15:58:11,114 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 15:58:11,115 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 15:58:11,117 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 15:58:11,120 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 15:58:11,122 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 15:58:11,123 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 15:58:11,125 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 15:58:11,126 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 15:58:11,127 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 15:58:11,128 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 15:58:11,130 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 15:58:11,131 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 15:58:11,133 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 15:58:11,134 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 15:58:11,141 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 15:58:11,144 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 15:58:11,152 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 15:58:11,156 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 15:58:11,178 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 15:58:11,179 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 15:58:11,184 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 15:58:11,184 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 15:58:11,184 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 15:58:11,190 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 15:58:11,191 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 15:58:11,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 15:58:11,193 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 15:58:11,194 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 15:58:11,196 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 15:58:11,198 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 15:58:11,199 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 15:58:11,199 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 15:58:11,200 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 15:58:11,200 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 15:58:11,201 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 15:58:11,203 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 15:58:11,204 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 15:58:11,209 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 15:58:11,273 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 15:58:11,274 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 15:58:11,276 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 15:58:11,277 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 15:58:11,277 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 15:58:11,277 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 15:58:11,277 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 15:58:11,278 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 15:58:11,278 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 15:58:11,280 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 15:58:11,281 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 15:58:11,281 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 15:58:11,281 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 15:58:11,282 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 15:58:11,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 15:58:11,282 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 15:58:11,282 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 15:58:11,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 15:58:11,283 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 15:58:11,283 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 15:58:11,283 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 15:58:11,283 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 15:58:11,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 15:58:11,284 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 15:58:11,284 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 15:58:11,284 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 15:58:11,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 15:58:11,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 15:58:11,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 15:58:11,777 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 15:58:11,778 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 15:58:11,779 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_BER_test5-3.i [2020-12-23 15:58:11,866 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e00df777f/1e460684f20d49668fff3a11a24c429e/FLAGc7530e23b [2020-12-23 15:58:12,769 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 15:58:12,770 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-3.i [2020-12-23 15:58:12,803 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e00df777f/1e460684f20d49668fff3a11a24c429e/FLAGc7530e23b [2020-12-23 15:58:12,866 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e00df777f/1e460684f20d49668fff3a11a24c429e [2020-12-23 15:58:12,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 15:58:12,874 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 15:58:12,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 15:58:12,879 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 15:58:12,883 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 15:58:12,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 03:58:12" (1/1) ... [2020-12-23 15:58:12,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16cf6c01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:58:12, skipping insertion in model container [2020-12-23 15:58:12,888 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 03:58:12" (1/1) ... [2020-12-23 15:58:12,898 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 15:58:12,970 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 15:58:13,570 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_BER_test5-3.i[33021,33034] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],StructAccessExpression[IdentifierExpression[~user~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem37,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem37,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem38,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem38,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem39,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem39,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem40,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem40,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem41,],base],StructAccessExpression[IdentifierExpression[#t~mem41,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem43,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem43,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem56,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem56,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem57,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem57,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem69,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem69,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~0,],base],StructAccessExpression[IdentifierExpression[~_ha_head~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_new_buckets~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem81,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem81,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem91,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem91,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem117,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem117,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem125,],base],StructAccessExpression[IdentifierExpression[#t~mem125,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem126,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem126,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem136,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem136,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[104],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem165,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem165,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem166,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem166,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem167,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem167,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem168,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem168,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,],base],StructAccessExpression[IdentifierExpression[#t~mem169,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem171,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem171,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~altusers~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem184,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem184,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem185,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem185,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem197,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem197,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~1,],base],StructAccessExpression[IdentifierExpression[~_ha_head~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_new_buckets~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem209,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem209,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem219,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem219,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem245,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem245,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem253,],base],StructAccessExpression[IdentifierExpression[#t~mem253,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem254,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem254,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem264,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem264,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] [2020-12-23 15:58:13,847 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_BER_test5-3.i[49681,49694] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~usertmp~0,] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem322,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem322,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem327,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem327,],offset],IdentifierExpression[#t~mem329,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem333,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem333,],offset],IdentifierExpression[#t~mem335,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~0,],base],StructAccessExpression[IdentifierExpression[~_hd_head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem347,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem347,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem350,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem350,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem363,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem363,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem368,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem368,],offset],IdentifierExpression[#t~mem370,]]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem374,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem374,],offset],IdentifierExpression[#t~mem376,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~1,],base],StructAccessExpression[IdentifierExpression[~_hd_head~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem388,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem388,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem391,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem391,],offset]]]] [2020-12-23 15:58:13,897 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 15:58:13,915 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 15:58:13,989 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_BER_test5-3.i[33021,33034] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],StructAccessExpression[IdentifierExpression[~user~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem37,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem37,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem38,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem38,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem39,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem39,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem40,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem40,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem41,],base],StructAccessExpression[IdentifierExpression[#t~mem41,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem43,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem43,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem56,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem56,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem57,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem57,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem69,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem69,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~0,],base],StructAccessExpression[IdentifierExpression[~_ha_head~0,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~#_he_new_buckets~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem83,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem83,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem93,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem93,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem120,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem120,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem128,],base],StructAccessExpression[IdentifierExpression[#t~mem128,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem130,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem130,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem140,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem140,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[104],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem169,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem170,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem170,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem171,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem171,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem172,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem172,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem173,],base],StructAccessExpression[IdentifierExpression[#t~mem173,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem175,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem175,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~altusers~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem188,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem188,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem189,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem189,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem201,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem201,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~1,],base],StructAccessExpression[IdentifierExpression[~_ha_head~1,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~#_he_new_buckets~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem215,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem215,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem225,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem225,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem252,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem252,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem260,],base],StructAccessExpression[IdentifierExpression[#t~mem260,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem262,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem262,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem272,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem272,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: IdentifierExpression[~#j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] [2020-12-23 15:58:14,108 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_BER_test5-3.i[49681,49694] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~usertmp~0,] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem330,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem330,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem335,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem335,],offset],IdentifierExpression[#t~mem337,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem341,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem341,],offset],IdentifierExpression[#t~mem343,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~0,],base],StructAccessExpression[IdentifierExpression[~_hd_head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem355,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem355,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem358,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem358,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem371,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem371,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem376,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem376,],offset],IdentifierExpression[#t~mem378,]]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem382,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem382,],offset],IdentifierExpression[#t~mem384,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~1,],base],StructAccessExpression[IdentifierExpression[~_hd_head~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem396,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem396,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem399,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem399,],offset]]]] [2020-12-23 15:58:14,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 15:58:14,216 INFO L208 MainTranslator]: Completed translation [2020-12-23 15:58:14,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:58:14 WrapperNode [2020-12-23 15:58:14,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 15:58:14,218 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 15:58:14,219 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 15:58:14,219 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 15:58:14,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:58:14" (1/1) ... [2020-12-23 15:58:14,283 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:58:14" (1/1) ... [2020-12-23 15:58:14,491 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 15:58:14,492 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 15:58:14,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 15:58:14,492 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 15:58:14,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:58:14" (1/1) ... [2020-12-23 15:58:14,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:58:14" (1/1) ... [2020-12-23 15:58:14,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:58:14" (1/1) ... [2020-12-23 15:58:14,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:58:14" (1/1) ... [2020-12-23 15:58:14,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:58:14" (1/1) ... [2020-12-23 15:58:14,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:58:14" (1/1) ... [2020-12-23 15:58:14,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:58:14" (1/1) ... [2020-12-23 15:58:14,722 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 15:58:14,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 15:58:14,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 15:58:14,725 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 15:58:14,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:58:14" (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 15:58:14,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 15:58:14,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 15:58:14,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 15:58:14,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 15:58:14,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 15:58:14,845 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2020-12-23 15:58:14,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 15:58:14,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 15:58:14,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 15:58:14,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 15:58:14,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 15:58:18,021 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 15:58:18,021 INFO L299 CfgBuilder]: Removed 128 assume(true) statements. [2020-12-23 15:58:18,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 03:58:18 BoogieIcfgContainer [2020-12-23 15:58:18,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 15:58:18,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 15:58:18,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 15:58:18,030 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 15:58:18,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 03:58:12" (1/3) ... [2020-12-23 15:58:18,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f7239a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 03:58:18, skipping insertion in model container [2020-12-23 15:58:18,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:58:14" (2/3) ... [2020-12-23 15:58:18,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f7239a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 03:58:18, skipping insertion in model container [2020-12-23 15:58:18,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 03:58:18" (3/3) ... [2020-12-23 15:58:18,035 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_BER_test5-3.i [2020-12-23 15:58:18,042 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 15:58:18,049 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-12-23 15:58:18,070 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-12-23 15:58:18,103 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 15:58:18,103 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 15:58:18,103 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 15:58:18,103 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 15:58:18,104 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 15:58:18,104 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 15:58:18,104 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 15:58:18,104 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 15:58:18,130 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states. [2020-12-23 15:58:18,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-23 15:58:18,137 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:58:18,138 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:58:18,138 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:58:18,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:58:18,145 INFO L82 PathProgramCache]: Analyzing trace with hash 889803109, now seen corresponding path program 1 times [2020-12-23 15:58:18,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:58:18,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131029793] [2020-12-23 15:58:18,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:58:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:58:18,355 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 15:58:18,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131029793] [2020-12-23 15:58:18,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:58:18,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 15:58:18,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423089933] [2020-12-23 15:58:18,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 15:58:18,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:58:18,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 15:58:18,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 15:58:18,382 INFO L87 Difference]: Start difference. First operand 308 states. Second operand 2 states. [2020-12-23 15:58:18,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:58:18,445 INFO L93 Difference]: Finished difference Result 614 states and 1036 transitions. [2020-12-23 15:58:18,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 15:58:18,447 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2020-12-23 15:58:18,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:58:18,465 INFO L225 Difference]: With dead ends: 614 [2020-12-23 15:58:18,465 INFO L226 Difference]: Without dead ends: 254 [2020-12-23 15:58:18,471 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 15:58:18,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2020-12-23 15:58:18,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2020-12-23 15:58:18,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-12-23 15:58:18,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 333 transitions. [2020-12-23 15:58:18,549 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 333 transitions. Word has length 8 [2020-12-23 15:58:18,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:58:18,550 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 333 transitions. [2020-12-23 15:58:18,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 15:58:18,552 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 333 transitions. [2020-12-23 15:58:18,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-23 15:58:18,557 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:58:18,557 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] [2020-12-23 15:58:18,558 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 15:58:18,559 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:58:18,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:58:18,560 INFO L82 PathProgramCache]: Analyzing trace with hash -680083191, now seen corresponding path program 1 times [2020-12-23 15:58:18,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:58:18,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057807929] [2020-12-23 15:58:18,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:58:18,622 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:58:18,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [450434426] [2020-12-23 15:58:18,623 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 15:58:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:58:19,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 15:58:19,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:58:19,103 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 15:58:19,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057807929] [2020-12-23 15:58:19,104 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:58:19,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450434426] [2020-12-23 15:58:19,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:58:19,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:58:19,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904464104] [2020-12-23 15:58:19,107 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:58:19,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:58:19,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:58:19,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:58:19,110 INFO L87 Difference]: Start difference. First operand 254 states and 333 transitions. Second operand 3 states. [2020-12-23 15:58:19,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:58:19,195 INFO L93 Difference]: Finished difference Result 587 states and 769 transitions. [2020-12-23 15:58:19,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:58:19,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2020-12-23 15:58:19,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:58:19,209 INFO L225 Difference]: With dead ends: 587 [2020-12-23 15:58:19,209 INFO L226 Difference]: Without dead ends: 505 [2020-12-23 15:58:19,215 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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 15:58:19,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2020-12-23 15:58:19,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 255. [2020-12-23 15:58:19,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2020-12-23 15:58:19,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 334 transitions. [2020-12-23 15:58:19,272 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 334 transitions. Word has length 42 [2020-12-23 15:58:19,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:58:19,272 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 334 transitions. [2020-12-23 15:58:19,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:58:19,273 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 334 transitions. [2020-12-23 15:58:19,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-23 15:58:19,284 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:58:19,284 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:58:19,498 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-12-23 15:58:19,499 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:58:19,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:58:19,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1837409632, now seen corresponding path program 1 times [2020-12-23 15:58:19,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:58:19,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405598633] [2020-12-23 15:58:19,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:58:19,565 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:58:19,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1014441622] [2020-12-23 15:58:19,566 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 15:58:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:58:20,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 15:58:20,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:58:20,199 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 15:58:20,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405598633] [2020-12-23 15:58:20,200 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:58:20,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014441622] [2020-12-23 15:58:20,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:58:20,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:58:20,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774120677] [2020-12-23 15:58:20,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:58:20,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:58:20,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:58:20,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:58:20,204 INFO L87 Difference]: Start difference. First operand 255 states and 334 transitions. Second operand 3 states. [2020-12-23 15:58:20,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:58:20,312 INFO L93 Difference]: Finished difference Result 528 states and 696 transitions. [2020-12-23 15:58:20,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:58:20,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2020-12-23 15:58:20,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:58:20,315 INFO L225 Difference]: With dead ends: 528 [2020-12-23 15:58:20,315 INFO L226 Difference]: Without dead ends: 276 [2020-12-23 15:58:20,317 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 138 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 15:58:20,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2020-12-23 15:58:20,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 275. [2020-12-23 15:58:20,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2020-12-23 15:58:20,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 354 transitions. [2020-12-23 15:58:20,332 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 354 transitions. Word has length 140 [2020-12-23 15:58:20,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:58:20,332 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 354 transitions. [2020-12-23 15:58:20,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:58:20,333 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 354 transitions. [2020-12-23 15:58:20,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-23 15:58:20,336 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:58:20,337 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:58:20,550 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:58:20,551 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:58:20,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:58:20,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1273244828, now seen corresponding path program 1 times [2020-12-23 15:58:20,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:58:20,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650038879] [2020-12-23 15:58:20,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:58:20,587 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:58:20,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [545505506] [2020-12-23 15:58:20,588 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 15:58:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:58:21,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 15:58:21,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:58:21,182 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 15:58:21,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650038879] [2020-12-23 15:58:21,182 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:58:21,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545505506] [2020-12-23 15:58:21,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:58:21,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:58:21,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513441176] [2020-12-23 15:58:21,186 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:58:21,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:58:21,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:58:21,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:58:21,187 INFO L87 Difference]: Start difference. First operand 275 states and 354 transitions. Second operand 3 states. [2020-12-23 15:58:21,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:58:21,295 INFO L93 Difference]: Finished difference Result 568 states and 736 transitions. [2020-12-23 15:58:21,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:58:21,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2020-12-23 15:58:21,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:58:21,298 INFO L225 Difference]: With dead ends: 568 [2020-12-23 15:58:21,298 INFO L226 Difference]: Without dead ends: 296 [2020-12-23 15:58:21,300 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 138 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 15:58:21,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-12-23 15:58:21,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 295. [2020-12-23 15:58:21,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2020-12-23 15:58:21,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 374 transitions. [2020-12-23 15:58:21,310 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 374 transitions. Word has length 140 [2020-12-23 15:58:21,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:58:21,311 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 374 transitions. [2020-12-23 15:58:21,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:58:21,311 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 374 transitions. [2020-12-23 15:58:21,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-23 15:58:21,315 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:58:21,315 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:58:21,528 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:58:21,529 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:58:21,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:58:21,531 INFO L82 PathProgramCache]: Analyzing trace with hash -882913824, now seen corresponding path program 1 times [2020-12-23 15:58:21,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:58:21,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496110090] [2020-12-23 15:58:21,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:58:21,578 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:58:21,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [709790803] [2020-12-23 15:58:21,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 15:58:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:58:21,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 15:58:21,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:58:22,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 15:58:22,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496110090] [2020-12-23 15:58:22,107 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:58:22,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709790803] [2020-12-23 15:58:22,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:58:22,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:58:22,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502917615] [2020-12-23 15:58:22,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:58:22,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:58:22,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:58:22,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:58:22,109 INFO L87 Difference]: Start difference. First operand 295 states and 374 transitions. Second operand 3 states. [2020-12-23 15:58:22,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:58:22,219 INFO L93 Difference]: Finished difference Result 397 states and 510 transitions. [2020-12-23 15:58:22,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:58:22,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2020-12-23 15:58:22,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:58:22,222 INFO L225 Difference]: With dead ends: 397 [2020-12-23 15:58:22,223 INFO L226 Difference]: Without dead ends: 316 [2020-12-23 15:58:22,223 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 138 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 15:58:22,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2020-12-23 15:58:22,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 315. [2020-12-23 15:58:22,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2020-12-23 15:58:22,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 394 transitions. [2020-12-23 15:58:22,233 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 394 transitions. Word has length 140 [2020-12-23 15:58:22,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:58:22,234 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 394 transitions. [2020-12-23 15:58:22,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:58:22,235 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 394 transitions. [2020-12-23 15:58:22,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-23 15:58:22,237 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:58:22,238 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:58:22,451 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:58:22,452 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:58:22,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:58:22,453 INFO L82 PathProgramCache]: Analyzing trace with hash 115522276, now seen corresponding path program 1 times [2020-12-23 15:58:22,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:58:22,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760901685] [2020-12-23 15:58:22,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:58:22,478 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:58:22,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1079784039] [2020-12-23 15:58:22,479 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 15:58:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:58:22,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 15:58:22,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:58:23,046 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 15:58:23,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760901685] [2020-12-23 15:58:23,047 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:58:23,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079784039] [2020-12-23 15:58:23,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:58:23,056 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 15:58:23,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154209442] [2020-12-23 15:58:23,057 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:58:23,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:58:23,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:58:23,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:58:23,064 INFO L87 Difference]: Start difference. First operand 315 states and 394 transitions. Second operand 4 states. [2020-12-23 15:58:23,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:58:23,192 INFO L93 Difference]: Finished difference Result 619 states and 777 transitions. [2020-12-23 15:58:23,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 15:58:23,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2020-12-23 15:58:23,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:58:23,195 INFO L225 Difference]: With dead ends: 619 [2020-12-23 15:58:23,195 INFO L226 Difference]: Without dead ends: 307 [2020-12-23 15:58:23,196 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 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 15:58:23,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2020-12-23 15:58:23,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 301. [2020-12-23 15:58:23,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2020-12-23 15:58:23,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 373 transitions. [2020-12-23 15:58:23,207 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 373 transitions. Word has length 140 [2020-12-23 15:58:23,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:58:23,207 INFO L481 AbstractCegarLoop]: Abstraction has 301 states and 373 transitions. [2020-12-23 15:58:23,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:58:23,208 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 373 transitions. [2020-12-23 15:58:23,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-23 15:58:23,209 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:58:23,210 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:58:23,424 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-12-23 15:58:23,425 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:58:23,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:58:23,426 INFO L82 PathProgramCache]: Analyzing trace with hash 32737814, now seen corresponding path program 1 times [2020-12-23 15:58:23,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:58:23,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073414408] [2020-12-23 15:58:23,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:58:23,451 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:58:23,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1810592323] [2020-12-23 15:58:23,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:58:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:58:23,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 15:58:23,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:58:23,980 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 15:58:23,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073414408] [2020-12-23 15:58:23,981 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:58:23,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810592323] [2020-12-23 15:58:23,982 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:58:23,982 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 15:58:23,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888887513] [2020-12-23 15:58:23,983 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:58:23,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:58:23,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:58:23,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:58:23,984 INFO L87 Difference]: Start difference. First operand 301 states and 373 transitions. Second operand 4 states. [2020-12-23 15:58:24,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:58:24,085 INFO L93 Difference]: Finished difference Result 680 states and 844 transitions. [2020-12-23 15:58:24,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 15:58:24,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2020-12-23 15:58:24,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:58:24,088 INFO L225 Difference]: With dead ends: 680 [2020-12-23 15:58:24,089 INFO L226 Difference]: Without dead ends: 382 [2020-12-23 15:58:24,090 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 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 15:58:24,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2020-12-23 15:58:24,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 287. [2020-12-23 15:58:24,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2020-12-23 15:58:24,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 352 transitions. [2020-12-23 15:58:24,100 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 352 transitions. Word has length 140 [2020-12-23 15:58:24,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:58:24,101 INFO L481 AbstractCegarLoop]: Abstraction has 287 states and 352 transitions. [2020-12-23 15:58:24,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:58:24,101 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 352 transitions. [2020-12-23 15:58:24,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-23 15:58:24,103 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:58:24,103 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:58:24,316 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:58:24,317 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:58:24,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:58:24,318 INFO L82 PathProgramCache]: Analyzing trace with hash -577227484, now seen corresponding path program 1 times [2020-12-23 15:58:24,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:58:24,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015415807] [2020-12-23 15:58:24,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:58:24,339 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:58:24,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1237919721] [2020-12-23 15:58:24,340 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 15:58:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:58:24,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 15:58:24,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:58:24,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 15:58:24,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015415807] [2020-12-23 15:58:24,943 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:58:24,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237919721] [2020-12-23 15:58:24,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:58:24,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 15:58:24,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602292745] [2020-12-23 15:58:24,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:58:24,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:58:24,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:58:24,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:58:24,950 INFO L87 Difference]: Start difference. First operand 287 states and 352 transitions. Second operand 4 states. [2020-12-23 15:58:25,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:58:25,068 INFO L93 Difference]: Finished difference Result 379 states and 468 transitions. [2020-12-23 15:58:25,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 15:58:25,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2020-12-23 15:58:25,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:58:25,072 INFO L225 Difference]: With dead ends: 379 [2020-12-23 15:58:25,072 INFO L226 Difference]: Without dead ends: 278 [2020-12-23 15:58:25,073 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 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 15:58:25,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-12-23 15:58:25,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 273. [2020-12-23 15:58:25,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2020-12-23 15:58:25,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 331 transitions. [2020-12-23 15:58:25,097 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 331 transitions. Word has length 140 [2020-12-23 15:58:25,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:58:25,099 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 331 transitions. [2020-12-23 15:58:25,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:58:25,099 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 331 transitions. [2020-12-23 15:58:25,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-23 15:58:25,101 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:58:25,101 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:58:25,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:58:25,315 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:58:25,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:58:25,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1460076330, now seen corresponding path program 1 times [2020-12-23 15:58:25,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:58:25,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140604211] [2020-12-23 15:58:25,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:58:25,339 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:58:25,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [412428269] [2020-12-23 15:58:25,340 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 15:58:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:58:25,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 15:58:25,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:58:25,865 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 15:58:25,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140604211] [2020-12-23 15:58:25,865 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:58:25,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412428269] [2020-12-23 15:58:25,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:58:25,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-12-23 15:58:25,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846269063] [2020-12-23 15:58:25,867 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:58:25,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:58:25,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:58:25,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:58:25,868 INFO L87 Difference]: Start difference. First operand 273 states and 331 transitions. Second operand 4 states. [2020-12-23 15:58:25,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:58:25,960 INFO L93 Difference]: Finished difference Result 811 states and 984 transitions. [2020-12-23 15:58:25,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 15:58:25,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2020-12-23 15:58:25,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:58:25,966 INFO L225 Difference]: With dead ends: 811 [2020-12-23 15:58:25,966 INFO L226 Difference]: Without dead ends: 723 [2020-12-23 15:58:25,967 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 137 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 15:58:25,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2020-12-23 15:58:25,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 455. [2020-12-23 15:58:25,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2020-12-23 15:58:25,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 553 transitions. [2020-12-23 15:58:25,991 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 553 transitions. Word has length 140 [2020-12-23 15:58:25,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:58:25,992 INFO L481 AbstractCegarLoop]: Abstraction has 455 states and 553 transitions. [2020-12-23 15:58:25,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:58:25,992 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 553 transitions. [2020-12-23 15:58:25,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2020-12-23 15:58:25,996 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:58:25,996 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:58:26,209 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2020-12-23 15:58:26,210 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:58:26,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:58:26,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1379453485, now seen corresponding path program 2 times [2020-12-23 15:58:26,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:58:26,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488416186] [2020-12-23 15:58:26,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:58:26,256 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:58:26,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2003666346] [2020-12-23 15:58:26,260 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 15:58:26,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 15:58:26,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:58:26,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 15:58:26,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:58:27,040 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 15:58:27,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488416186] [2020-12-23 15:58:27,041 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:58:27,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003666346] [2020-12-23 15:58:27,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:58:27,041 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-12-23 15:58:27,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519236500] [2020-12-23 15:58:27,042 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 15:58:27,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:58:27,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 15:58:27,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:58:27,043 INFO L87 Difference]: Start difference. First operand 455 states and 553 transitions. Second operand 5 states. [2020-12-23 15:58:27,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:58:27,139 INFO L93 Difference]: Finished difference Result 1080 states and 1310 transitions. [2020-12-23 15:58:27,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 15:58:27,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 238 [2020-12-23 15:58:27,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:58:27,146 INFO L225 Difference]: With dead ends: 1080 [2020-12-23 15:58:27,146 INFO L226 Difference]: Without dead ends: 992 [2020-12-23 15:58:27,147 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 234 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 15:58:27,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2020-12-23 15:58:27,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 637. [2020-12-23 15:58:27,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2020-12-23 15:58:27,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 775 transitions. [2020-12-23 15:58:27,182 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 775 transitions. Word has length 238 [2020-12-23 15:58:27,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:58:27,183 INFO L481 AbstractCegarLoop]: Abstraction has 637 states and 775 transitions. [2020-12-23 15:58:27,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 15:58:27,183 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 775 transitions. [2020-12-23 15:58:27,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2020-12-23 15:58:27,189 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:58:27,190 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:58:27,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:58:27,406 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:58:27,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:58:27,407 INFO L82 PathProgramCache]: Analyzing trace with hash 449267140, now seen corresponding path program 3 times [2020-12-23 15:58:27,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:58:27,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012325047] [2020-12-23 15:58:27,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:58:27,440 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:58:27,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [238867994] [2020-12-23 15:58:27,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 15:58:27,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-23 15:58:27,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:58:27,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 15:58:27,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:58:28,589 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2020-12-23 15:58:28,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012325047] [2020-12-23 15:58:28,590 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:58:28,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238867994] [2020-12-23 15:58:28,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:58:28,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:58:28,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452446630] [2020-12-23 15:58:28,592 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:58:28,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:58:28,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:58:28,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:58:28,593 INFO L87 Difference]: Start difference. First operand 637 states and 775 transitions. Second operand 3 states. [2020-12-23 15:58:28,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:58:28,682 INFO L93 Difference]: Finished difference Result 1216 states and 1484 transitions. [2020-12-23 15:58:28,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:58:28,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2020-12-23 15:58:28,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:58:28,690 INFO L225 Difference]: With dead ends: 1216 [2020-12-23 15:58:28,690 INFO L226 Difference]: Without dead ends: 635 [2020-12-23 15:58:28,692 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 334 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 15:58:28,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-12-23 15:58:28,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2020-12-23 15:58:28,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2020-12-23 15:58:28,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 772 transitions. [2020-12-23 15:58:28,718 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 772 transitions. Word has length 336 [2020-12-23 15:58:28,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:58:28,719 INFO L481 AbstractCegarLoop]: Abstraction has 635 states and 772 transitions. [2020-12-23 15:58:28,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:58:28,719 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 772 transitions. [2020-12-23 15:58:28,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2020-12-23 15:58:28,726 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:58:28,726 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:58:28,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:58:28,934 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:58:28,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:58:28,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1855273396, now seen corresponding path program 1 times [2020-12-23 15:58:28,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:58:28,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640065764] [2020-12-23 15:58:28,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:58:28,964 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:58:28,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1755155860] [2020-12-23 15:58:28,964 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 15:58:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:58:29,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 989 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 15:58:29,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:58:29,881 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2020-12-23 15:58:29,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640065764] [2020-12-23 15:58:29,882 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:58:29,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755155860] [2020-12-23 15:58:29,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:58:29,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:58:29,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121093749] [2020-12-23 15:58:29,884 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:58:29,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:58:29,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:58:29,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:58:29,885 INFO L87 Difference]: Start difference. First operand 635 states and 772 transitions. Second operand 3 states. [2020-12-23 15:58:29,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:58:29,955 INFO L93 Difference]: Finished difference Result 1232 states and 1512 transitions. [2020-12-23 15:58:29,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:58:29,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 343 [2020-12-23 15:58:29,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:58:29,959 INFO L225 Difference]: With dead ends: 1232 [2020-12-23 15:58:29,960 INFO L226 Difference]: Without dead ends: 647 [2020-12-23 15:58:29,961 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 341 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 15:58:29,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2020-12-23 15:58:29,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2020-12-23 15:58:29,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2020-12-23 15:58:29,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 784 transitions. [2020-12-23 15:58:29,983 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 784 transitions. Word has length 343 [2020-12-23 15:58:29,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:58:29,984 INFO L481 AbstractCegarLoop]: Abstraction has 647 states and 784 transitions. [2020-12-23 15:58:29,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:58:29,984 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 784 transitions. [2020-12-23 15:58:29,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2020-12-23 15:58:29,990 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:58:29,990 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:58:30,203 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-12-23 15:58:30,204 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:58:30,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:58:30,205 INFO L82 PathProgramCache]: Analyzing trace with hash 162679507, now seen corresponding path program 1 times [2020-12-23 15:58:30,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:58:30,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455232783] [2020-12-23 15:58:30,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:58:30,237 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:58:30,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [767194873] [2020-12-23 15:58:30,238 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 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 15:58:30,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:58:30,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 1001 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 15:58:30,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:58:31,219 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 73 proven. 1 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2020-12-23 15:58:31,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455232783] [2020-12-23 15:58:31,219 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:58:31,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767194873] [2020-12-23 15:58:31,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:58:31,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-12-23 15:58:31,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096195658] [2020-12-23 15:58:31,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:58:31,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:58:31,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:58:31,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:58:31,222 INFO L87 Difference]: Start difference. First operand 647 states and 784 transitions. Second operand 4 states. [2020-12-23 15:58:31,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:58:31,303 INFO L93 Difference]: Finished difference Result 1255 states and 1535 transitions. [2020-12-23 15:58:31,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 15:58:31,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 345 [2020-12-23 15:58:31,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:58:31,308 INFO L225 Difference]: With dead ends: 1255 [2020-12-23 15:58:31,308 INFO L226 Difference]: Without dead ends: 659 [2020-12-23 15:58:31,309 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 342 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 15:58:31,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2020-12-23 15:58:31,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2020-12-23 15:58:31,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2020-12-23 15:58:31,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 796 transitions. [2020-12-23 15:58:31,336 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 796 transitions. Word has length 345 [2020-12-23 15:58:31,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:58:31,336 INFO L481 AbstractCegarLoop]: Abstraction has 659 states and 796 transitions. [2020-12-23 15:58:31,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:58:31,336 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 796 transitions. [2020-12-23 15:58:31,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2020-12-23 15:58:31,340 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:58:31,340 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:58:31,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-12-23 15:58:31,554 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:58:31,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:58:31,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1649703700, now seen corresponding path program 2 times [2020-12-23 15:58:31,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:58:31,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806726193] [2020-12-23 15:58:31,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:58:31,581 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:58:31,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [119357558] [2020-12-23 15:58:31,582 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 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 [2020-12-23 15:58:32,259 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 15:58:32,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:58:32,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 15:58:32,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:58:32,717 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 73 proven. 3 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2020-12-23 15:58:32,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806726193] [2020-12-23 15:58:32,719 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:58:32,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119357558] [2020-12-23 15:58:32,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:58:32,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-12-23 15:58:32,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063325889] [2020-12-23 15:58:32,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 15:58:32,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:58:32,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 15:58:32,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:58:32,723 INFO L87 Difference]: Start difference. First operand 659 states and 796 transitions. Second operand 5 states. [2020-12-23 15:58:32,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:58:32,841 INFO L93 Difference]: Finished difference Result 1278 states and 1558 transitions. [2020-12-23 15:58:32,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 15:58:32,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 347 [2020-12-23 15:58:32,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:58:32,846 INFO L225 Difference]: With dead ends: 1278 [2020-12-23 15:58:32,846 INFO L226 Difference]: Without dead ends: 671 [2020-12-23 15:58:32,848 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 343 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 15:58:32,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2020-12-23 15:58:32,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2020-12-23 15:58:32,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2020-12-23 15:58:32,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 808 transitions. [2020-12-23 15:58:32,878 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 808 transitions. Word has length 347 [2020-12-23 15:58:32,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:58:32,879 INFO L481 AbstractCegarLoop]: Abstraction has 671 states and 808 transitions. [2020-12-23 15:58:32,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 15:58:32,879 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 808 transitions. [2020-12-23 15:58:32,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2020-12-23 15:58:32,883 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:58:32,883 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:58:33,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-12-23 15:58:33,099 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:58:33,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:58:33,100 INFO L82 PathProgramCache]: Analyzing trace with hash 457445491, now seen corresponding path program 3 times [2020-12-23 15:58:33,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:58:33,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708993723] [2020-12-23 15:58:33,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:58:33,130 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:58:33,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [943759700] [2020-12-23 15:58:33,131 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:58:33,599 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-23 15:58:33,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:58:33,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 15:58:33,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:58:34,144 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2020-12-23 15:58:34,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708993723] [2020-12-23 15:58:34,145 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:58:34,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943759700] [2020-12-23 15:58:34,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:58:34,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:58:34,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724576471] [2020-12-23 15:58:34,146 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:58:34,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:58:34,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:58:34,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:58:34,146 INFO L87 Difference]: Start difference. First operand 671 states and 808 transitions. Second operand 3 states. [2020-12-23 15:58:34,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:58:34,239 INFO L93 Difference]: Finished difference Result 1256 states and 1514 transitions. [2020-12-23 15:58:34,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:58:34,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 349 [2020-12-23 15:58:34,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:58:34,244 INFO L225 Difference]: With dead ends: 1256 [2020-12-23 15:58:34,244 INFO L226 Difference]: Without dead ends: 740 [2020-12-23 15:58:34,246 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 347 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 15:58:34,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2020-12-23 15:58:34,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 728. [2020-12-23 15:58:34,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2020-12-23 15:58:34,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 880 transitions. [2020-12-23 15:58:34,274 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 880 transitions. Word has length 349 [2020-12-23 15:58:34,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:58:34,275 INFO L481 AbstractCegarLoop]: Abstraction has 728 states and 880 transitions. [2020-12-23 15:58:34,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:58:34,275 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 880 transitions. [2020-12-23 15:58:34,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2020-12-23 15:58:34,278 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:58:34,279 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 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 15:58:34,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:58:34,494 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:58:34,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:58:34,494 INFO L82 PathProgramCache]: Analyzing trace with hash -2060178602, now seen corresponding path program 1 times [2020-12-23 15:58:34,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:58:34,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902337282] [2020-12-23 15:58:34,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:58:34,529 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:58:34,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1757855154] [2020-12-23 15:58:34,530 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:58:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:58:35,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 1149 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-23 15:58:35,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:58:35,542 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 73 proven. 6 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-12-23 15:58:35,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902337282] [2020-12-23 15:58:35,542 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:58:35,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757855154] [2020-12-23 15:58:35,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:58:35,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-12-23 15:58:35,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705586575] [2020-12-23 15:58:35,544 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 15:58:35,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:58:35,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 15:58:35,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 15:58:35,545 INFO L87 Difference]: Start difference. First operand 728 states and 880 transitions. Second operand 6 states. [2020-12-23 15:58:35,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:58:35,701 INFO L93 Difference]: Finished difference Result 1415 states and 1725 transitions. [2020-12-23 15:58:35,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 15:58:35,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 362 [2020-12-23 15:58:35,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:58:35,708 INFO L225 Difference]: With dead ends: 1415 [2020-12-23 15:58:35,708 INFO L226 Difference]: Without dead ends: 740 [2020-12-23 15:58:35,710 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 357 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 15:58:35,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2020-12-23 15:58:35,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2020-12-23 15:58:35,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2020-12-23 15:58:35,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 892 transitions. [2020-12-23 15:58:35,738 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 892 transitions. Word has length 362 [2020-12-23 15:58:35,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:58:35,739 INFO L481 AbstractCegarLoop]: Abstraction has 740 states and 892 transitions. [2020-12-23 15:58:35,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 15:58:35,739 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 892 transitions. [2020-12-23 15:58:35,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2020-12-23 15:58:35,742 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:58:35,742 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 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 15:58:35,957 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-12-23 15:58:35,958 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:58:35,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:58:35,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1507573012, now seen corresponding path program 2 times [2020-12-23 15:58:35,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:58:35,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979998956] [2020-12-23 15:58:35,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:58:35,991 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:58:35,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [846101701] [2020-12-23 15:58:35,992 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:58:36,740 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 15:58:36,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:58:36,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 1173 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-23 15:58:36,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:58:37,173 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 73 proven. 10 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2020-12-23 15:58:37,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979998956] [2020-12-23 15:58:37,173 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:58:37,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846101701] [2020-12-23 15:58:37,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:58:37,174 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-12-23 15:58:37,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954951819] [2020-12-23 15:58:37,174 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 15:58:37,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:58:37,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 15:58:37,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-23 15:58:37,176 INFO L87 Difference]: Start difference. First operand 740 states and 892 transitions. Second operand 7 states. [2020-12-23 15:58:37,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:58:37,316 INFO L93 Difference]: Finished difference Result 1438 states and 1748 transitions. [2020-12-23 15:58:37,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 15:58:37,317 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 366 [2020-12-23 15:58:37,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:58:37,321 INFO L225 Difference]: With dead ends: 1438 [2020-12-23 15:58:37,322 INFO L226 Difference]: Without dead ends: 752 [2020-12-23 15:58:37,324 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 360 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 15:58:37,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2020-12-23 15:58:37,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 752. [2020-12-23 15:58:37,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2020-12-23 15:58:37,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 904 transitions. [2020-12-23 15:58:37,361 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 904 transitions. Word has length 366 [2020-12-23 15:58:37,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:58:37,362 INFO L481 AbstractCegarLoop]: Abstraction has 752 states and 904 transitions. [2020-12-23 15:58:37,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 15:58:37,362 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 904 transitions. [2020-12-23 15:58:37,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2020-12-23 15:58:37,368 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:58:37,369 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 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 15:58:37,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-12-23 15:58:37,584 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:58:37,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:58:37,585 INFO L82 PathProgramCache]: Analyzing trace with hash 823733142, now seen corresponding path program 3 times [2020-12-23 15:58:37,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:58:37,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651292038] [2020-12-23 15:58:37,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:58:37,627 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:58:37,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1351919794] [2020-12-23 15:58:37,628 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:58:38,127 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-23 15:58:38,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:58:38,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 15:58:38,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:58:38,650 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2020-12-23 15:58:38,650 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651292038] [2020-12-23 15:58:38,650 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:58:38,650 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351919794] [2020-12-23 15:58:38,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:58:38,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:58:38,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212367711] [2020-12-23 15:58:38,651 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:58:38,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:58:38,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:58:38,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:58:38,652 INFO L87 Difference]: Start difference. First operand 752 states and 904 transitions. Second operand 3 states. [2020-12-23 15:58:38,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:58:38,768 INFO L93 Difference]: Finished difference Result 1376 states and 1653 transitions. [2020-12-23 15:58:38,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:58:38,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 370 [2020-12-23 15:58:38,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:58:38,776 INFO L225 Difference]: With dead ends: 1376 [2020-12-23 15:58:38,777 INFO L226 Difference]: Without dead ends: 1027 [2020-12-23 15:58:38,779 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 368 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 15:58:38,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2020-12-23 15:58:38,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 1015. [2020-12-23 15:58:38,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2020-12-23 15:58:38,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1222 transitions. [2020-12-23 15:58:38,824 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1222 transitions. Word has length 370 [2020-12-23 15:58:38,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:58:38,825 INFO L481 AbstractCegarLoop]: Abstraction has 1015 states and 1222 transitions. [2020-12-23 15:58:38,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:58:38,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1222 transitions. [2020-12-23 15:58:38,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2020-12-23 15:58:38,829 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:58:38,830 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:58:39,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-23 15:58:39,044 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:58:39,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:58:39,044 INFO L82 PathProgramCache]: Analyzing trace with hash -145231630, now seen corresponding path program 1 times [2020-12-23 15:58:39,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:58:39,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593335794] [2020-12-23 15:58:39,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:58:39,087 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:58:39,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [379749780] [2020-12-23 15:58:39,087 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:58:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:58:39,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 1223 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-23 15:58:39,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:58:40,161 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 73 proven. 15 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2020-12-23 15:58:40,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593335794] [2020-12-23 15:58:40,162 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:58:40,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379749780] [2020-12-23 15:58:40,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:58:40,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-12-23 15:58:40,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198770276] [2020-12-23 15:58:40,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 15:58:40,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:58:40,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 15:58:40,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-12-23 15:58:40,165 INFO L87 Difference]: Start difference. First operand 1015 states and 1222 transitions. Second operand 8 states. [2020-12-23 15:58:40,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:58:40,313 INFO L93 Difference]: Finished difference Result 1989 states and 2411 transitions. [2020-12-23 15:58:40,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 15:58:40,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 377 [2020-12-23 15:58:40,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:58:40,319 INFO L225 Difference]: With dead ends: 1989 [2020-12-23 15:58:40,320 INFO L226 Difference]: Without dead ends: 1029 [2020-12-23 15:58:40,322 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-12-23 15:58:40,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2020-12-23 15:58:40,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1029. [2020-12-23 15:58:40,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2020-12-23 15:58:40,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1236 transitions. [2020-12-23 15:58:40,361 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1236 transitions. Word has length 377 [2020-12-23 15:58:40,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:58:40,362 INFO L481 AbstractCegarLoop]: Abstraction has 1029 states and 1236 transitions. [2020-12-23 15:58:40,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 15:58:40,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1236 transitions. [2020-12-23 15:58:40,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2020-12-23 15:58:40,395 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:58:40,395 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:58:40,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:58:40,598 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:58:40,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:58:40,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1700907916, now seen corresponding path program 2 times [2020-12-23 15:58:40,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:58:40,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865173949] [2020-12-23 15:58:40,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:58:40,649 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:58:40,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1310657410] [2020-12-23 15:58:40,650 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:58:41,508 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 15:58:41,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:58:41,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 1247 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-23 15:58:41,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:58:41,919 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 73 proven. 21 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2020-12-23 15:58:41,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865173949] [2020-12-23 15:58:41,920 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:58:41,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310657410] [2020-12-23 15:58:41,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:58:41,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-12-23 15:58:41,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538053622] [2020-12-23 15:58:41,921 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 15:58:41,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:58:41,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 15:58:41,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-12-23 15:58:41,922 INFO L87 Difference]: Start difference. First operand 1029 states and 1236 transitions. Second operand 9 states. [2020-12-23 15:58:42,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:58:42,075 INFO L93 Difference]: Finished difference Result 2016 states and 2438 transitions. [2020-12-23 15:58:42,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 15:58:42,076 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 381 [2020-12-23 15:58:42,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:58:42,082 INFO L225 Difference]: With dead ends: 2016 [2020-12-23 15:58:42,082 INFO L226 Difference]: Without dead ends: 1043 [2020-12-23 15:58:42,084 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-12-23 15:58:42,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2020-12-23 15:58:42,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1043. [2020-12-23 15:58:42,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2020-12-23 15:58:42,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1250 transitions. [2020-12-23 15:58:42,126 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1250 transitions. Word has length 381 [2020-12-23 15:58:42,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:58:42,127 INFO L481 AbstractCegarLoop]: Abstraction has 1043 states and 1250 transitions. [2020-12-23 15:58:42,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 15:58:42,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1250 transitions. [2020-12-23 15:58:42,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2020-12-23 15:58:42,131 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:58:42,132 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:58:42,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:58:42,341 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:58:42,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:58:42,342 INFO L82 PathProgramCache]: Analyzing trace with hash -336611150, now seen corresponding path program 3 times [2020-12-23 15:58:42,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:58:42,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936555947] [2020-12-23 15:58:42,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:58:42,381 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:58:42,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1831382844] [2020-12-23 15:58:42,382 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true