/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_test4-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 15:55:24,160 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 15:55:24,164 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 15:55:24,218 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 15:55:24,219 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 15:55:24,223 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 15:55:24,226 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 15:55:24,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 15:55:24,235 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 15:55:24,241 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 15:55:24,246 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 15:55:24,247 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 15:55:24,248 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 15:55:24,251 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 15:55:24,253 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 15:55:24,254 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 15:55:24,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 15:55:24,259 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 15:55:24,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 15:55:24,273 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 15:55:24,275 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 15:55:24,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 15:55:24,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 15:55:24,281 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 15:55:24,289 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 15:55:24,289 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 15:55:24,289 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 15:55:24,291 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 15:55:24,292 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 15:55:24,293 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 15:55:24,293 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 15:55:24,294 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 15:55:24,296 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 15:55:24,297 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 15:55:24,298 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 15:55:24,298 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 15:55:24,299 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 15:55:24,305 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 15:55:24,306 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 15:55:24,307 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 15:55:24,308 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 15:55:24,313 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:55:24,357 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 15:55:24,357 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 15:55:24,361 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 15:55:24,361 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 15:55:24,362 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 15:55:24,362 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 15:55:24,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 15:55:24,362 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 15:55:24,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 15:55:24,363 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 15:55:24,364 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 15:55:24,364 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 15:55:24,365 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 15:55:24,365 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 15:55:24,365 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 15:55:24,365 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 15:55:24,365 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 15:55:24,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 15:55:24,366 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 15:55:24,366 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 15:55:24,366 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 15:55:24,367 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 15:55:24,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 15:55:24,367 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 15:55:24,367 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 15:55:24,367 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:55:24,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 15:55:24,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 15:55:24,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 15:55:24,848 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 15:55:24,848 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 15:55:24,849 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_test4-1.i [2020-12-23 15:55:24,949 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/1e9f3de1c/6eed4fd9be0f4ba3ad8c1f36349e3ebd/FLAG1b9c56b2a [2020-12-23 15:55:25,688 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 15:55:25,689 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i [2020-12-23 15:55:25,715 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/1e9f3de1c/6eed4fd9be0f4ba3ad8c1f36349e3ebd/FLAG1b9c56b2a [2020-12-23 15:55:25,888 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/1e9f3de1c/6eed4fd9be0f4ba3ad8c1f36349e3ebd [2020-12-23 15:55:25,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 15:55:25,894 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 15:55:25,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 15:55:25,898 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 15:55:25,903 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 15:55:25,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 03:55:25" (1/1) ... [2020-12-23 15:55:25,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61a484f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:55:25, skipping insertion in model container [2020-12-23 15:55:25,908 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 03:55:25" (1/1) ... [2020-12-23 15:55:25,922 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 15:55:26,015 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 15:55:26,439 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_test4-1.i[33021,33034] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],StructAccessExpression[IdentifierExpression[~user~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem37,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem37,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem38,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem38,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem39,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem39,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem40,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem40,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem41,],base],StructAccessExpression[IdentifierExpression[#t~mem41,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem43,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem43,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem56,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem56,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem57,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem57,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem69,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem69,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~0,],base],StructAccessExpression[IdentifierExpression[~_ha_head~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_new_buckets~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem81,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem81,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem91,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem91,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem117,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem117,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem125,],base],StructAccessExpression[IdentifierExpression[#t~mem125,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem126,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem126,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem136,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem136,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[104],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem165,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem165,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem166,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem166,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem167,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem167,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem168,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem168,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,],base],StructAccessExpression[IdentifierExpression[#t~mem169,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem171,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem171,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~altusers~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem184,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem184,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem185,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem185,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem197,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem197,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~1,],base],StructAccessExpression[IdentifierExpression[~_ha_head~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_new_buckets~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem209,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem209,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem219,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem219,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem245,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem245,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem253,],base],StructAccessExpression[IdentifierExpression[#t~mem253,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem254,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem254,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem264,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem264,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] [2020-12-23 15:55:26,651 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 15:55:26,667 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 15:55:26,706 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_test4-1.i[33021,33034] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],StructAccessExpression[IdentifierExpression[~user~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem37,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem37,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem38,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem38,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem39,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem39,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem40,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem40,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem41,],base],StructAccessExpression[IdentifierExpression[#t~mem41,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem43,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem43,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem56,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem56,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem57,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem57,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem69,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem69,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~0,],base],StructAccessExpression[IdentifierExpression[~_ha_head~0,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~#_he_new_buckets~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem83,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem83,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem93,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem93,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem120,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem120,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem128,],base],StructAccessExpression[IdentifierExpression[#t~mem128,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem130,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem130,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem140,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem140,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[104],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem169,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem170,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem170,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem171,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem171,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem172,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem172,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem173,],base],StructAccessExpression[IdentifierExpression[#t~mem173,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem175,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem175,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~altusers~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem188,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem188,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem189,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem189,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem201,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem201,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~1,],base],StructAccessExpression[IdentifierExpression[~_ha_head~1,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~#_he_new_buckets~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem215,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem215,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem225,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem225,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem252,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem252,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem260,],base],StructAccessExpression[IdentifierExpression[#t~mem260,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem262,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem262,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem272,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem272,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] [2020-12-23 15:55:26,872 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 15:55:26,958 INFO L208 MainTranslator]: Completed translation [2020-12-23 15:55:26,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:55:26 WrapperNode [2020-12-23 15:55:26,959 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 15:55:26,960 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 15:55:26,960 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 15:55:26,961 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 15:55:26,969 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:55:26" (1/1) ... [2020-12-23 15:55:27,009 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:55:26" (1/1) ... [2020-12-23 15:55:27,116 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 15:55:27,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 15:55:27,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 15:55:27,121 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 15:55:27,131 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:55:26" (1/1) ... [2020-12-23 15:55:27,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:55:26" (1/1) ... [2020-12-23 15:55:27,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:55:26" (1/1) ... [2020-12-23 15:55:27,173 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:55:26" (1/1) ... [2020-12-23 15:55:27,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:55:26" (1/1) ... [2020-12-23 15:55:27,287 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:55:26" (1/1) ... [2020-12-23 15:55:27,305 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:55:26" (1/1) ... [2020-12-23 15:55:27,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 15:55:27,331 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 15:55:27,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 15:55:27,331 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 15:55:27,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:55:26" (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:55:27,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 15:55:27,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 15:55:27,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 15:55:27,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 15:55:27,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 15:55:27,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 15:55:27,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 15:55:27,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 15:55:27,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 15:55:27,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 15:55:29,668 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 15:55:29,669 INFO L299 CfgBuilder]: Removed 98 assume(true) statements. [2020-12-23 15:55:29,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 03:55:29 BoogieIcfgContainer [2020-12-23 15:55:29,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 15:55:29,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 15:55:29,673 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 15:55:29,676 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 15:55:29,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 03:55:25" (1/3) ... [2020-12-23 15:55:29,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a422e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 03:55:29, skipping insertion in model container [2020-12-23 15:55:29,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:55:26" (2/3) ... [2020-12-23 15:55:29,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a422e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 03:55:29, skipping insertion in model container [2020-12-23 15:55:29,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 03:55:29" (3/3) ... [2020-12-23 15:55:29,680 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_BER_test4-1.i [2020-12-23 15:55:29,686 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 15:55:29,692 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2020-12-23 15:55:29,711 INFO L253 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2020-12-23 15:55:29,738 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 15:55:29,738 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 15:55:29,739 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 15:55:29,739 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 15:55:29,739 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 15:55:29,739 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 15:55:29,739 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 15:55:29,739 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 15:55:29,760 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states. [2020-12-23 15:55:29,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-23 15:55:29,766 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:55:29,766 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:55:29,767 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:55:29,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:55:29,773 INFO L82 PathProgramCache]: Analyzing trace with hash 889550569, now seen corresponding path program 1 times [2020-12-23 15:55:29,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:55:29,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162447313] [2020-12-23 15:55:29,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:55:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:55:29,931 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:55:29,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162447313] [2020-12-23 15:55:29,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:55:29,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 15:55:29,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589819656] [2020-12-23 15:55:29,938 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 15:55:29,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:55:29,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 15:55:29,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 15:55:29,956 INFO L87 Difference]: Start difference. First operand 221 states. Second operand 2 states. [2020-12-23 15:55:30,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:55:30,001 INFO L93 Difference]: Finished difference Result 440 states and 724 transitions. [2020-12-23 15:55:30,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 15:55:30,003 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2020-12-23 15:55:30,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:55:30,017 INFO L225 Difference]: With dead ends: 440 [2020-12-23 15:55:30,017 INFO L226 Difference]: Without dead ends: 217 [2020-12-23 15:55:30,021 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:55:30,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-12-23 15:55:30,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2020-12-23 15:55:30,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-12-23 15:55:30,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 282 transitions. [2020-12-23 15:55:30,077 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 282 transitions. Word has length 8 [2020-12-23 15:55:30,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:55:30,078 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 282 transitions. [2020-12-23 15:55:30,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 15:55:30,078 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 282 transitions. [2020-12-23 15:55:30,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-23 15:55:30,079 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:55:30,079 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:55:30,079 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 15:55:30,080 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:55:30,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:55:30,081 INFO L82 PathProgramCache]: Analyzing trace with hash 921152950, now seen corresponding path program 1 times [2020-12-23 15:55:30,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:55:30,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90880155] [2020-12-23 15:55:30,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:55:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:55:30,147 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:55:30,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90880155] [2020-12-23 15:55:30,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:55:30,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:55:30,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760388632] [2020-12-23 15:55:30,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:55:30,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:55:30,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:55:30,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:55:30,153 INFO L87 Difference]: Start difference. First operand 217 states and 282 transitions. Second operand 3 states. [2020-12-23 15:55:30,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:55:30,231 INFO L93 Difference]: Finished difference Result 432 states and 562 transitions. [2020-12-23 15:55:30,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:55:30,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-12-23 15:55:30,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:55:30,237 INFO L225 Difference]: With dead ends: 432 [2020-12-23 15:55:30,237 INFO L226 Difference]: Without dead ends: 387 [2020-12-23 15:55:30,242 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:55:30,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2020-12-23 15:55:30,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 218. [2020-12-23 15:55:30,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-12-23 15:55:30,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 283 transitions. [2020-12-23 15:55:30,263 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 283 transitions. Word has length 8 [2020-12-23 15:55:30,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:55:30,263 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 283 transitions. [2020-12-23 15:55:30,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:55:30,264 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 283 transitions. [2020-12-23 15:55:30,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 15:55:30,270 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:55:30,271 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:55:30,271 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 15:55:30,271 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:55:30,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:55:30,272 INFO L82 PathProgramCache]: Analyzing trace with hash -137963571, now seen corresponding path program 1 times [2020-12-23 15:55:30,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:55:30,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490005438] [2020-12-23 15:55:30,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:55:30,325 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:55:30,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [162693377] [2020-12-23 15:55:30,326 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:55:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:55:30,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 15:55:30,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:55:30,790 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:55:30,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490005438] [2020-12-23 15:55:30,791 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:55:30,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162693377] [2020-12-23 15:55:30,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:55:30,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:55:30,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340529255] [2020-12-23 15:55:30,793 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:55:30,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:55:30,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:55:30,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:55:30,794 INFO L87 Difference]: Start difference. First operand 218 states and 283 transitions. Second operand 3 states. [2020-12-23 15:55:30,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:55:30,873 INFO L93 Difference]: Finished difference Result 454 states and 594 transitions. [2020-12-23 15:55:30,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:55:30,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-12-23 15:55:30,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:55:30,876 INFO L225 Difference]: With dead ends: 454 [2020-12-23 15:55:30,876 INFO L226 Difference]: Without dead ends: 239 [2020-12-23 15:55:30,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:55:30,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-12-23 15:55:30,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 238. [2020-12-23 15:55:30,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2020-12-23 15:55:30,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 303 transitions. [2020-12-23 15:55:30,892 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 303 transitions. Word has length 106 [2020-12-23 15:55:30,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:55:30,893 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 303 transitions. [2020-12-23 15:55:30,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:55:30,893 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 303 transitions. [2020-12-23 15:55:30,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 15:55:30,898 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:55:30,898 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:55:31,113 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-12-23 15:55:31,115 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:55:31,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:55:31,117 INFO L82 PathProgramCache]: Analyzing trace with hash 62310097, now seen corresponding path program 1 times [2020-12-23 15:55:31,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:55:31,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118219880] [2020-12-23 15:55:31,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:55:31,148 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:55:31,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [703525760] [2020-12-23 15:55:31,149 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:55:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:55:31,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 15:55:31,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:55:31,506 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:55:31,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118219880] [2020-12-23 15:55:31,507 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:55:31,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703525760] [2020-12-23 15:55:31,507 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:55:31,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:55:31,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467441394] [2020-12-23 15:55:31,508 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:55:31,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:55:31,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:55:31,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:55:31,511 INFO L87 Difference]: Start difference. First operand 238 states and 303 transitions. Second operand 3 states. [2020-12-23 15:55:31,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:55:31,600 INFO L93 Difference]: Finished difference Result 494 states and 634 transitions. [2020-12-23 15:55:31,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:55:31,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-12-23 15:55:31,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:55:31,603 INFO L225 Difference]: With dead ends: 494 [2020-12-23 15:55:31,604 INFO L226 Difference]: Without dead ends: 259 [2020-12-23 15:55:31,607 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:55:31,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2020-12-23 15:55:31,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 258. [2020-12-23 15:55:31,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2020-12-23 15:55:31,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 323 transitions. [2020-12-23 15:55:31,634 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 323 transitions. Word has length 106 [2020-12-23 15:55:31,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:55:31,636 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 323 transitions. [2020-12-23 15:55:31,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:55:31,637 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 323 transitions. [2020-12-23 15:55:31,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 15:55:31,648 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:55:31,649 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:55:31,863 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:55:31,865 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:55:31,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:55:31,866 INFO L82 PathProgramCache]: Analyzing trace with hash -426500019, now seen corresponding path program 1 times [2020-12-23 15:55:31,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:55:31,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242331272] [2020-12-23 15:55:31,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:55:31,905 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:55:31,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1971341408] [2020-12-23 15:55:31,906 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:55:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:55:32,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 15:55:32,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:55:32,302 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:55:32,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242331272] [2020-12-23 15:55:32,303 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:55:32,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971341408] [2020-12-23 15:55:32,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:55:32,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 15:55:32,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269957701] [2020-12-23 15:55:32,306 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:55:32,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:55:32,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:55:32,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:55:32,307 INFO L87 Difference]: Start difference. First operand 258 states and 323 transitions. Second operand 4 states. [2020-12-23 15:55:32,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:55:32,400 INFO L93 Difference]: Finished difference Result 505 states and 635 transitions. [2020-12-23 15:55:32,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 15:55:32,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2020-12-23 15:55:32,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:55:32,402 INFO L225 Difference]: With dead ends: 505 [2020-12-23 15:55:32,403 INFO L226 Difference]: Without dead ends: 250 [2020-12-23 15:55:32,404 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:55:32,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-12-23 15:55:32,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 244. [2020-12-23 15:55:32,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2020-12-23 15:55:32,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 302 transitions. [2020-12-23 15:55:32,412 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 302 transitions. Word has length 106 [2020-12-23 15:55:32,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:55:32,412 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 302 transitions. [2020-12-23 15:55:32,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:55:32,413 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 302 transitions. [2020-12-23 15:55:32,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 15:55:32,415 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:55:32,416 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:55:32,630 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:55:32,632 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:55:32,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:55:32,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1791075329, now seen corresponding path program 1 times [2020-12-23 15:55:32,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:55:32,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181758206] [2020-12-23 15:55:32,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:55:32,695 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:55:32,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [996471574] [2020-12-23 15:55:32,697 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:55:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:55:32,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 15:55:32,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:55:33,087 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:55:33,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181758206] [2020-12-23 15:55:33,088 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:55:33,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996471574] [2020-12-23 15:55:33,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:55:33,088 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 15:55:33,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868403102] [2020-12-23 15:55:33,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:55:33,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:55:33,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:55:33,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:55:33,090 INFO L87 Difference]: Start difference. First operand 244 states and 302 transitions. Second operand 4 states. [2020-12-23 15:55:33,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:55:33,189 INFO L93 Difference]: Finished difference Result 566 states and 702 transitions. [2020-12-23 15:55:33,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 15:55:33,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2020-12-23 15:55:33,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:55:33,193 INFO L225 Difference]: With dead ends: 566 [2020-12-23 15:55:33,193 INFO L226 Difference]: Without dead ends: 325 [2020-12-23 15:55:33,194 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:55:33,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-12-23 15:55:33,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 230. [2020-12-23 15:55:33,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-12-23 15:55:33,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 281 transitions. [2020-12-23 15:55:33,203 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 281 transitions. Word has length 106 [2020-12-23 15:55:33,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:55:33,205 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 281 transitions. [2020-12-23 15:55:33,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:55:33,205 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 281 transitions. [2020-12-23 15:55:33,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 15:55:33,206 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:55:33,207 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:55:33,422 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:55:33,423 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:55:33,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:55:33,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1369189005, now seen corresponding path program 1 times [2020-12-23 15:55:33,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:55:33,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465531959] [2020-12-23 15:55:33,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:55:33,443 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:55:33,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [679761221] [2020-12-23 15:55:33,444 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:55:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:55:33,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 15:55:33,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:55:33,869 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:55:33,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465531959] [2020-12-23 15:55:33,870 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:55:33,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679761221] [2020-12-23 15:55:33,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:55:33,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-12-23 15:55:33,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290803396] [2020-12-23 15:55:33,872 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:55:33,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:55:33,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:55:33,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:55:33,873 INFO L87 Difference]: Start difference. First operand 230 states and 281 transitions. Second operand 4 states. [2020-12-23 15:55:33,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:55:33,912 INFO L93 Difference]: Finished difference Result 638 states and 780 transitions. [2020-12-23 15:55:33,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 15:55:33,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2020-12-23 15:55:33,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:55:33,920 INFO L225 Difference]: With dead ends: 638 [2020-12-23 15:55:33,920 INFO L226 Difference]: Without dead ends: 593 [2020-12-23 15:55:33,922 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:55:33,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-12-23 15:55:33,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 412. [2020-12-23 15:55:33,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2020-12-23 15:55:33,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 503 transitions. [2020-12-23 15:55:33,943 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 503 transitions. Word has length 106 [2020-12-23 15:55:33,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:55:33,944 INFO L481 AbstractCegarLoop]: Abstraction has 412 states and 503 transitions. [2020-12-23 15:55:33,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:55:33,945 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 503 transitions. [2020-12-23 15:55:33,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2020-12-23 15:55:33,950 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:55:33,950 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:55:34,165 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-23 15:55:34,166 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:55:34,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:55:34,168 INFO L82 PathProgramCache]: Analyzing trace with hash 548829604, now seen corresponding path program 2 times [2020-12-23 15:55:34,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:55:34,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361290628] [2020-12-23 15:55:34,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:55:34,189 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:55:34,189 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1956655835] [2020-12-23 15:55:34,189 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:55:34,403 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 15:55:34,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:55:34,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-23 15:55:34,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:55:34,781 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-12-23 15:55:34,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361290628] [2020-12-23 15:55:34,782 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:55:34,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956655835] [2020-12-23 15:55:34,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:55:34,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 15:55:34,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793359943] [2020-12-23 15:55:34,784 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:55:34,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:55:34,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:55:34,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:55:34,785 INFO L87 Difference]: Start difference. First operand 412 states and 503 transitions. Second operand 4 states. [2020-12-23 15:55:35,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:55:35,151 INFO L93 Difference]: Finished difference Result 677 states and 831 transitions. [2020-12-23 15:55:35,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:55:35,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2020-12-23 15:55:35,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:55:35,154 INFO L225 Difference]: With dead ends: 677 [2020-12-23 15:55:35,154 INFO L226 Difference]: Without dead ends: 410 [2020-12-23 15:55:35,155 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:55:35,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2020-12-23 15:55:35,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2020-12-23 15:55:35,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2020-12-23 15:55:35,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 500 transitions. [2020-12-23 15:55:35,168 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 500 transitions. Word has length 204 [2020-12-23 15:55:35,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:55:35,169 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 500 transitions. [2020-12-23 15:55:35,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:55:35,169 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 500 transitions. [2020-12-23 15:55:35,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2020-12-23 15:55:35,172 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:55:35,172 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:55:35,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:55:35,386 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:55:35,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:55:35,388 INFO L82 PathProgramCache]: Analyzing trace with hash -7696284, now seen corresponding path program 1 times [2020-12-23 15:55:35,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:55:35,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940576229] [2020-12-23 15:55:35,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:55:35,412 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:55:35,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [356466730] [2020-12-23 15:55:35,413 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:55:35,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:55:35,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 15:55:35,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:55:35,961 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-23 15:55:35,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940576229] [2020-12-23 15:55:35,962 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:55:35,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356466730] [2020-12-23 15:55:35,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:55:35,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:55:35,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6109402] [2020-12-23 15:55:35,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:55:35,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:55:35,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:55:35,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:55:35,964 INFO L87 Difference]: Start difference. First operand 410 states and 500 transitions. Second operand 3 states. [2020-12-23 15:55:36,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:55:36,018 INFO L93 Difference]: Finished difference Result 776 states and 957 transitions. [2020-12-23 15:55:36,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:55:36,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2020-12-23 15:55:36,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:55:36,022 INFO L225 Difference]: With dead ends: 776 [2020-12-23 15:55:36,022 INFO L226 Difference]: Without dead ends: 418 [2020-12-23 15:55:36,023 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:55:36,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2020-12-23 15:55:36,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2020-12-23 15:55:36,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-12-23 15:55:36,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 508 transitions. [2020-12-23 15:55:36,037 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 508 transitions. Word has length 211 [2020-12-23 15:55:36,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:55:36,037 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 508 transitions. [2020-12-23 15:55:36,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:55:36,037 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 508 transitions. [2020-12-23 15:55:36,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-12-23 15:55:36,040 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:55:36,041 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:55:36,253 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:55:36,254 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:55:36,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:55:36,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1887603621, now seen corresponding path program 1 times [2020-12-23 15:55:36,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:55:36,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295371984] [2020-12-23 15:55:36,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:55:36,281 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:55:36,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [445112667] [2020-12-23 15:55:36,281 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:55:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:55:36,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 15:55:36,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:55:36,878 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-12-23 15:55:36,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295371984] [2020-12-23 15:55:36,879 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:55:36,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445112667] [2020-12-23 15:55:36,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:55:36,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-12-23 15:55:36,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727352888] [2020-12-23 15:55:36,880 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:55:36,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:55:36,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:55:36,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:55:36,881 INFO L87 Difference]: Start difference. First operand 418 states and 508 transitions. Second operand 4 states. [2020-12-23 15:55:36,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:55:36,948 INFO L93 Difference]: Finished difference Result 791 states and 972 transitions. [2020-12-23 15:55:36,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 15:55:36,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2020-12-23 15:55:36,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:55:36,951 INFO L225 Difference]: With dead ends: 791 [2020-12-23 15:55:36,951 INFO L226 Difference]: Without dead ends: 426 [2020-12-23 15:55:36,952 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:55:36,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2020-12-23 15:55:36,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2020-12-23 15:55:36,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2020-12-23 15:55:36,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 516 transitions. [2020-12-23 15:55:36,965 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 516 transitions. Word has length 213 [2020-12-23 15:55:36,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:55:36,966 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 516 transitions. [2020-12-23 15:55:36,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:55:36,966 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 516 transitions. [2020-12-23 15:55:36,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-12-23 15:55:36,969 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:55:36,969 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:55:37,183 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-23 15:55:37,183 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:55:37,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:55:37,184 INFO L82 PathProgramCache]: Analyzing trace with hash -546185468, now seen corresponding path program 2 times [2020-12-23 15:55:37,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:55:37,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27470706] [2020-12-23 15:55:37,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:55:37,229 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:55:37,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1971356620] [2020-12-23 15:55:37,229 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:55:37,599 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 15:55:37,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:55:37,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 15:55:37,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:55:37,815 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 84 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-12-23 15:55:37,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27470706] [2020-12-23 15:55:37,816 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:55:37,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971356620] [2020-12-23 15:55:37,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:55:37,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-12-23 15:55:37,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513633828] [2020-12-23 15:55:37,817 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 15:55:37,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:55:37,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 15:55:37,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:55:37,818 INFO L87 Difference]: Start difference. First operand 426 states and 516 transitions. Second operand 5 states. [2020-12-23 15:55:37,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:55:37,897 INFO L93 Difference]: Finished difference Result 806 states and 987 transitions. [2020-12-23 15:55:37,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 15:55:37,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 215 [2020-12-23 15:55:37,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:55:37,900 INFO L225 Difference]: With dead ends: 806 [2020-12-23 15:55:37,900 INFO L226 Difference]: Without dead ends: 434 [2020-12-23 15:55:37,901 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:55:37,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-12-23 15:55:37,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2020-12-23 15:55:37,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-12-23 15:55:37,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 524 transitions. [2020-12-23 15:55:37,915 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 524 transitions. Word has length 215 [2020-12-23 15:55:37,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:55:37,916 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 524 transitions. [2020-12-23 15:55:37,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 15:55:37,916 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 524 transitions. [2020-12-23 15:55:37,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2020-12-23 15:55:37,919 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:55:37,919 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:55:38,133 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:55:38,134 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:55:38,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:55:38,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1962229253, now seen corresponding path program 3 times [2020-12-23 15:55:38,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:55:38,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446289792] [2020-12-23 15:55:38,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:55:38,157 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:55:38,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [567711900] [2020-12-23 15:55:38,157 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:55:38,452 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-23 15:55:38,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:55:38,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 15:55:38,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:55:38,739 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2020-12-23 15:55:38,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446289792] [2020-12-23 15:55:38,740 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:55:38,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567711900] [2020-12-23 15:55:38,740 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:55:38,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:55:38,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124665637] [2020-12-23 15:55:38,741 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:55:38,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:55:38,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:55:38,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:55:38,742 INFO L87 Difference]: Start difference. First operand 434 states and 524 transitions. Second operand 3 states. [2020-12-23 15:55:38,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:55:38,826 INFO L93 Difference]: Finished difference Result 804 states and 976 transitions. [2020-12-23 15:55:38,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:55:38,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2020-12-23 15:55:38,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:55:38,830 INFO L225 Difference]: With dead ends: 804 [2020-12-23 15:55:38,830 INFO L226 Difference]: Without dead ends: 432 [2020-12-23 15:55:38,831 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:55:38,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2020-12-23 15:55:38,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2020-12-23 15:55:38,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2020-12-23 15:55:38,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 521 transitions. [2020-12-23 15:55:38,847 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 521 transitions. Word has length 217 [2020-12-23 15:55:38,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:55:38,847 INFO L481 AbstractCegarLoop]: Abstraction has 432 states and 521 transitions. [2020-12-23 15:55:38,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:55:38,847 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 521 transitions. [2020-12-23 15:55:38,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2020-12-23 15:55:38,850 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:55:38,851 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:55:39,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:55:39,066 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:55:39,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:55:39,067 INFO L82 PathProgramCache]: Analyzing trace with hash -511436746, now seen corresponding path program 1 times [2020-12-23 15:55:39,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:55:39,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519829953] [2020-12-23 15:55:39,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:55:39,085 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:55:39,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [293847312] [2020-12-23 15:55:39,086 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:55:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:55:39,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-23 15:55:39,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:55:39,719 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-12-23 15:55:39,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519829953] [2020-12-23 15:55:39,719 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:55:39,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293847312] [2020-12-23 15:55:39,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:55:39,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-12-23 15:55:39,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614185992] [2020-12-23 15:55:39,720 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 15:55:39,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:55:39,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 15:55:39,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 15:55:39,721 INFO L87 Difference]: Start difference. First operand 432 states and 521 transitions. Second operand 6 states. [2020-12-23 15:55:39,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:55:39,826 INFO L93 Difference]: Finished difference Result 819 states and 999 transitions. [2020-12-23 15:55:39,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 15:55:39,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 230 [2020-12-23 15:55:39,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:55:39,829 INFO L225 Difference]: With dead ends: 819 [2020-12-23 15:55:39,829 INFO L226 Difference]: Without dead ends: 440 [2020-12-23 15:55:39,830 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 15:55:39,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-12-23 15:55:39,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2020-12-23 15:55:39,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-12-23 15:55:39,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 529 transitions. [2020-12-23 15:55:39,847 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 529 transitions. Word has length 230 [2020-12-23 15:55:39,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:55:39,848 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 529 transitions. [2020-12-23 15:55:39,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 15:55:39,848 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 529 transitions. [2020-12-23 15:55:39,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-12-23 15:55:39,851 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:55:39,851 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:55:40,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-12-23 15:55:40,065 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:55:40,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:55:40,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1844438796, now seen corresponding path program 2 times [2020-12-23 15:55:40,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:55:40,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809430792] [2020-12-23 15:55:40,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:55:40,084 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:55:40,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [299323076] [2020-12-23 15:55:40,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:55:40,497 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 15:55:40,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:55:40,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-23 15:55:40,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:55:40,815 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2020-12-23 15:55:40,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809430792] [2020-12-23 15:55:40,816 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:55:40,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299323076] [2020-12-23 15:55:40,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:55:40,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-12-23 15:55:40,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131888451] [2020-12-23 15:55:40,817 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 15:55:40,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:55:40,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 15:55:40,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-23 15:55:40,818 INFO L87 Difference]: Start difference. First operand 440 states and 529 transitions. Second operand 7 states. [2020-12-23 15:55:40,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:55:40,923 INFO L93 Difference]: Finished difference Result 834 states and 1014 transitions. [2020-12-23 15:55:40,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 15:55:40,924 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 234 [2020-12-23 15:55:40,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:55:40,926 INFO L225 Difference]: With dead ends: 834 [2020-12-23 15:55:40,926 INFO L226 Difference]: Without dead ends: 448 [2020-12-23 15:55:40,927 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-23 15:55:40,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2020-12-23 15:55:40,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2020-12-23 15:55:40,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2020-12-23 15:55:40,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 537 transitions. [2020-12-23 15:55:40,944 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 537 transitions. Word has length 234 [2020-12-23 15:55:40,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:55:40,944 INFO L481 AbstractCegarLoop]: Abstraction has 448 states and 537 transitions. [2020-12-23 15:55:40,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 15:55:40,944 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 537 transitions. [2020-12-23 15:55:40,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2020-12-23 15:55:40,946 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:55:40,946 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:55:41,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-12-23 15:55:41,159 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:55:41,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:55:41,160 INFO L82 PathProgramCache]: Analyzing trace with hash 951531638, now seen corresponding path program 3 times [2020-12-23 15:55:41,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:55:41,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827588046] [2020-12-23 15:55:41,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:55:41,180 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:55:41,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [395456572] [2020-12-23 15:55:41,186 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true