/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_OAT_test10-3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 16:17:22,338 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 16:17:22,341 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 16:17:22,376 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 16:17:22,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 16:17:22,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 16:17:22,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 16:17:22,383 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 16:17:22,385 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 16:17:22,387 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 16:17:22,388 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 16:17:22,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 16:17:22,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 16:17:22,392 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 16:17:22,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 16:17:22,395 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 16:17:22,407 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 16:17:22,410 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 16:17:22,413 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 16:17:22,416 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 16:17:22,421 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 16:17:22,427 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 16:17:22,429 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 16:17:22,430 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 16:17:22,433 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 16:17:22,434 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 16:17:22,434 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 16:17:22,435 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 16:17:22,436 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 16:17:22,437 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 16:17:22,438 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 16:17:22,439 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 16:17:22,440 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 16:17:22,441 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 16:17:22,442 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 16:17:22,442 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 16:17:22,443 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 16:17:22,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 16:17:22,444 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 16:17:22,445 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 16:17:22,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 16:17:22,447 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 16:17:22,478 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 16:17:22,478 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 16:17:22,480 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 16:17:22,480 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 16:17:22,480 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 16:17:22,481 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 16:17:22,481 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 16:17:22,481 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 16:17:22,482 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 16:17:22,482 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 16:17:22,482 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 16:17:22,482 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 16:17:22,483 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 16:17:22,483 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 16:17:22,483 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 16:17:22,484 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 16:17:22,484 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 16:17:22,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 16:17:22,484 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 16:17:22,485 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 16:17:22,485 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 16:17:22,485 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 16:17:22,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 16:17:22,486 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 16:17:22,486 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 16:17:22,486 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 16:17:22,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 16:17:22,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 16:17:22,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 16:17:22,939 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 16:17:22,940 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 16:17:22,942 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_OAT_test10-3.i [2020-12-23 16:17:23,041 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/df4594c80/ab9148cbe2bf476da353643cbf65bdc7/FLAG0fc932f5b [2020-12-23 16:17:23,890 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 16:17:23,891 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-3.i [2020-12-23 16:17:23,919 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/df4594c80/ab9148cbe2bf476da353643cbf65bdc7/FLAG0fc932f5b [2020-12-23 16:17:24,059 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/df4594c80/ab9148cbe2bf476da353643cbf65bdc7 [2020-12-23 16:17:24,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 16:17:24,068 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 16:17:24,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 16:17:24,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 16:17:24,080 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 16:17:24,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 04:17:24" (1/1) ... [2020-12-23 16:17:24,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dcc773f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:17:24, skipping insertion in model container [2020-12-23 16:17:24,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 04:17:24" (1/1) ... [2020-12-23 16:17:24,096 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 16:17:24,207 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 16:17:24,897 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_OAT_test10-3.i[33022,33035] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],StructAccessExpression[IdentifierExpression[~user~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem37,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem37,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem38,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem38,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem39,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem39,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem40,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem40,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem41,],base],StructAccessExpression[IdentifierExpression[#t~mem41,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem43,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem43,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem56,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem56,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem57,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem57,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem69,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem69,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~0,],base],StructAccessExpression[IdentifierExpression[~_ha_head~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_new_buckets~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem81,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem81,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem91,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem91,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem117,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem117,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem125,],base],StructAccessExpression[IdentifierExpression[#t~mem125,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem126,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem126,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem136,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem136,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[104],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem165,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem165,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem166,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem166,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem167,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem167,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem168,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem168,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,],base],StructAccessExpression[IdentifierExpression[#t~mem169,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem171,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem171,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~altusers~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem184,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem184,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem185,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem185,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem197,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem197,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~1,],base],StructAccessExpression[IdentifierExpression[~_ha_head~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_new_buckets~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem209,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem209,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem219,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem219,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem245,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem245,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem253,],base],StructAccessExpression[IdentifierExpression[#t~mem253,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem254,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem254,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem264,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem264,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~3,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~3,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~4,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~4,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~3,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~5,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~5,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~usertmp~0,] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem449,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem449,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem454,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem454,],offset],IdentifierExpression[#t~mem456,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem460,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem460,],offset],IdentifierExpression[#t~mem462,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~0,],base],StructAccessExpression[IdentifierExpression[~_hd_head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem474,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem474,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem477,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem477,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem490,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem490,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem495,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem495,],offset],IdentifierExpression[#t~mem497,]]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem501,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem501,],offset],IdentifierExpression[#t~mem503,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~1,],base],StructAccessExpression[IdentifierExpression[~_hd_head~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem515,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem515,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem518,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem518,],offset]]]] [2020-12-23 16:17:25,294 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 16:17:25,318 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 16:17:25,378 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_OAT_test10-3.i[33022,33035] left hand side expression in assignment: address: IdentifierExpression[~#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~mem43,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem43,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem44,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem44,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem45,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem45,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem46,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem46,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem47,],base],StructAccessExpression[IdentifierExpression[#t~mem47,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem49,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem49,],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~mem62,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem62,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem63,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem63,],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~mem75,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem75,],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~mem89,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem89,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem99,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem99,],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~mem126,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem126,],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~mem134,],base],StructAccessExpression[IdentifierExpression[#t~mem134,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem136,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem136,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem146,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem146,],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~mem175,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem175,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem176,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem176,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem177,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem177,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem178,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem178,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem179,],base],StructAccessExpression[IdentifierExpression[#t~mem179,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem181,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem181,],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~mem194,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem194,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem195,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem195,],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~mem207,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem207,],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~mem221,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem221,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem231,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem231,],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~mem258,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem258,],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~mem266,],base],StructAccessExpression[IdentifierExpression[#t~mem266,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem268,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem268,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem278,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem278,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~#i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~3,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~3,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: address: IdentifierExpression[~#i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~4,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~4,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~3,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~5,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~5,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~usertmp~0,] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem467,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem467,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem472,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem472,],offset],IdentifierExpression[#t~mem474,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem478,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem478,],offset],IdentifierExpression[#t~mem480,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~0,],base],StructAccessExpression[IdentifierExpression[~_hd_head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem492,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem492,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem495,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem495,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem508,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem508,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem513,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem513,],offset],IdentifierExpression[#t~mem515,]]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem519,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem519,],offset],IdentifierExpression[#t~mem521,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~1,],base],StructAccessExpression[IdentifierExpression[~_hd_head~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem533,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem533,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem536,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem536,],offset]]]] [2020-12-23 16:17:25,618 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 16:17:25,718 INFO L208 MainTranslator]: Completed translation [2020-12-23 16:17:25,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:17:25 WrapperNode [2020-12-23 16:17:25,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 16:17:25,722 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 16:17:25,722 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 16:17:25,722 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 16:17:25,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:17:25" (1/1) ... [2020-12-23 16:17:25,806 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:17:25" (1/1) ... [2020-12-23 16:17:25,983 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 16:17:25,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 16:17:25,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 16:17:25,984 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 16:17:25,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:17:25" (1/1) ... [2020-12-23 16:17:25,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:17:25" (1/1) ... [2020-12-23 16:17:26,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:17:25" (1/1) ... [2020-12-23 16:17:26,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:17:25" (1/1) ... [2020-12-23 16:17:26,155 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:17:25" (1/1) ... [2020-12-23 16:17:26,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:17:25" (1/1) ... [2020-12-23 16:17:26,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:17:25" (1/1) ... [2020-12-23 16:17:26,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 16:17:26,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 16:17:26,276 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 16:17:26,276 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 16:17:26,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:17:25" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 16:17:26,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 16:17:26,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 16:17:26,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 16:17:26,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 16:17:26,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 16:17:26,479 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2020-12-23 16:17:26,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 16:17:26,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 16:17:26,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 16:17:26,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 16:17:26,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 16:17:30,320 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 16:17:30,321 INFO L299 CfgBuilder]: Removed 224 assume(true) statements. [2020-12-23 16:17:30,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 04:17:30 BoogieIcfgContainer [2020-12-23 16:17:30,326 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 16:17:30,327 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 16:17:30,328 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 16:17:30,331 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 16:17:30,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 04:17:24" (1/3) ... [2020-12-23 16:17:30,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc7042e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 04:17:30, skipping insertion in model container [2020-12-23 16:17:30,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:17:25" (2/3) ... [2020-12-23 16:17:30,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc7042e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 04:17:30, skipping insertion in model container [2020-12-23 16:17:30,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 04:17:30" (3/3) ... [2020-12-23 16:17:30,335 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test10-3.i [2020-12-23 16:17:30,342 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 16:17:30,350 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2020-12-23 16:17:30,371 INFO L253 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2020-12-23 16:17:30,408 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 16:17:30,408 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 16:17:30,408 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 16:17:30,409 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 16:17:30,409 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 16:17:30,409 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 16:17:30,409 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 16:17:30,409 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 16:17:30,440 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states. [2020-12-23 16:17:30,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-23 16:17:30,449 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:17:30,450 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:17:30,451 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:17:30,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:17:30,458 INFO L82 PathProgramCache]: Analyzing trace with hash -128377380, now seen corresponding path program 1 times [2020-12-23 16:17:30,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:17:30,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904525843] [2020-12-23 16:17:30,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:17:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:17:30,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:17:30,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904525843] [2020-12-23 16:17:30,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:17:30,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 16:17:30,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37154979] [2020-12-23 16:17:30,756 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 16:17:30,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:17:30,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 16:17:30,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 16:17:30,783 INFO L87 Difference]: Start difference. First operand 520 states. Second operand 2 states. [2020-12-23 16:17:30,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:17:30,875 INFO L93 Difference]: Finished difference Result 1038 states and 1752 transitions. [2020-12-23 16:17:30,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 16:17:30,877 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2020-12-23 16:17:30,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:17:30,899 INFO L225 Difference]: With dead ends: 1038 [2020-12-23 16:17:30,899 INFO L226 Difference]: Without dead ends: 465 [2020-12-23 16:17:30,906 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 16:17:30,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2020-12-23 16:17:31,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2020-12-23 16:17:31,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2020-12-23 16:17:31,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 608 transitions. [2020-12-23 16:17:31,048 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 608 transitions. Word has length 9 [2020-12-23 16:17:31,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:17:31,048 INFO L481 AbstractCegarLoop]: Abstraction has 465 states and 608 transitions. [2020-12-23 16:17:31,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 16:17:31,048 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 608 transitions. [2020-12-23 16:17:31,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-23 16:17:31,054 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:17:31,054 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] [2020-12-23 16:17:31,054 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 16:17:31,055 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:17:31,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:17:31,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1568739198, now seen corresponding path program 1 times [2020-12-23 16:17:31,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:17:31,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160724680] [2020-12-23 16:17:31,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:17:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:17:31,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:17:31,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160724680] [2020-12-23 16:17:31,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:17:31,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 16:17:31,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981429451] [2020-12-23 16:17:31,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:17:31,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:17:31,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:17:31,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:17:31,189 INFO L87 Difference]: Start difference. First operand 465 states and 608 transitions. Second operand 4 states. [2020-12-23 16:17:32,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:17:32,046 INFO L93 Difference]: Finished difference Result 831 states and 1087 transitions. [2020-12-23 16:17:32,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:17:32,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2020-12-23 16:17:32,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:17:32,051 INFO L225 Difference]: With dead ends: 831 [2020-12-23 16:17:32,051 INFO L226 Difference]: Without dead ends: 540 [2020-12-23 16:17:32,054 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:17:32,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-12-23 16:17:32,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 467. [2020-12-23 16:17:32,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2020-12-23 16:17:32,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 610 transitions. [2020-12-23 16:17:32,111 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 610 transitions. Word has length 44 [2020-12-23 16:17:32,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:17:32,111 INFO L481 AbstractCegarLoop]: Abstraction has 467 states and 610 transitions. [2020-12-23 16:17:32,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:17:32,111 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 610 transitions. [2020-12-23 16:17:32,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-23 16:17:32,119 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:17:32,119 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:17:32,120 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 16:17:32,123 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:17:32,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:17:32,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1325558428, now seen corresponding path program 1 times [2020-12-23 16:17:32,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:17:32,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079593720] [2020-12-23 16:17:32,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:17:32,205 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:17:32,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [856193173] [2020-12-23 16:17:32,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:17:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:17:32,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:17:32,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:17:32,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:17:32,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079593720] [2020-12-23 16:17:32,726 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:17:32,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856193173] [2020-12-23 16:17:32,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:17:32,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:17:32,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867824790] [2020-12-23 16:17:32,728 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:17:32,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:17:32,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:17:32,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:17:32,729 INFO L87 Difference]: Start difference. First operand 467 states and 610 transitions. Second operand 3 states. [2020-12-23 16:17:32,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:17:32,861 INFO L93 Difference]: Finished difference Result 951 states and 1247 transitions. [2020-12-23 16:17:32,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:17:32,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2020-12-23 16:17:32,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:17:32,865 INFO L225 Difference]: With dead ends: 951 [2020-12-23 16:17:32,866 INFO L226 Difference]: Without dead ends: 488 [2020-12-23 16:17:32,868 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:17:32,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2020-12-23 16:17:32,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 487. [2020-12-23 16:17:32,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2020-12-23 16:17:32,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 630 transitions. [2020-12-23 16:17:32,892 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 630 transitions. Word has length 97 [2020-12-23 16:17:32,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:17:32,893 INFO L481 AbstractCegarLoop]: Abstraction has 487 states and 630 transitions. [2020-12-23 16:17:32,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:17:32,893 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 630 transitions. [2020-12-23 16:17:32,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-23 16:17:32,896 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:17:32,896 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:17:33,110 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-12-23 16:17:33,112 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:17:33,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:17:33,113 INFO L82 PathProgramCache]: Analyzing trace with hash 948433376, now seen corresponding path program 1 times [2020-12-23 16:17:33,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:17:33,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563733686] [2020-12-23 16:17:33,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:17:33,141 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:17:33,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1434654601] [2020-12-23 16:17:33,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:17:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:17:33,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:17:33,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:17:33,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 16:17:33,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563733686] [2020-12-23 16:17:33,681 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:17:33,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434654601] [2020-12-23 16:17:33,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:17:33,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:17:33,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310466248] [2020-12-23 16:17:33,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:17:33,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:17:33,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:17:33,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:17:33,685 INFO L87 Difference]: Start difference. First operand 487 states and 630 transitions. Second operand 3 states. [2020-12-23 16:17:33,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:17:33,806 INFO L93 Difference]: Finished difference Result 787 states and 1024 transitions. [2020-12-23 16:17:33,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:17:33,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2020-12-23 16:17:33,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:17:33,810 INFO L225 Difference]: With dead ends: 787 [2020-12-23 16:17:33,810 INFO L226 Difference]: Without dead ends: 508 [2020-12-23 16:17:33,811 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:17:33,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2020-12-23 16:17:33,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 507. [2020-12-23 16:17:33,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2020-12-23 16:17:33,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 650 transitions. [2020-12-23 16:17:33,826 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 650 transitions. Word has length 97 [2020-12-23 16:17:33,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:17:33,826 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 650 transitions. [2020-12-23 16:17:33,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:17:33,827 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 650 transitions. [2020-12-23 16:17:33,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-23 16:17:33,830 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:17:33,830 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:17:34,044 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:17:34,045 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:17:34,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:17:34,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1352389214, now seen corresponding path program 1 times [2020-12-23 16:17:34,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:17:34,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945049454] [2020-12-23 16:17:34,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:17:34,081 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:17:34,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1395918061] [2020-12-23 16:17:34,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:17:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:17:34,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:17:34,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:17:34,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:17:34,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945049454] [2020-12-23 16:17:34,635 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:17:34,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395918061] [2020-12-23 16:17:34,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:17:34,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 16:17:34,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453851046] [2020-12-23 16:17:34,636 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:17:34,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:17:34,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:17:34,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:17:34,638 INFO L87 Difference]: Start difference. First operand 507 states and 650 transitions. Second operand 4 states. [2020-12-23 16:17:34,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:17:34,755 INFO L93 Difference]: Finished difference Result 1086 states and 1400 transitions. [2020-12-23 16:17:34,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:17:34,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2020-12-23 16:17:34,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:17:34,760 INFO L225 Difference]: With dead ends: 1086 [2020-12-23 16:17:34,760 INFO L226 Difference]: Without dead ends: 583 [2020-12-23 16:17:34,762 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:17:34,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-12-23 16:17:34,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 493. [2020-12-23 16:17:34,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2020-12-23 16:17:34,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 629 transitions. [2020-12-23 16:17:34,780 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 629 transitions. Word has length 97 [2020-12-23 16:17:34,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:17:34,781 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 629 transitions. [2020-12-23 16:17:34,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:17:34,781 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 629 transitions. [2020-12-23 16:17:34,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-23 16:17:34,783 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:17:34,784 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:17:34,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:17:34,994 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:17:34,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:17:34,996 INFO L82 PathProgramCache]: Analyzing trace with hash 881478960, now seen corresponding path program 1 times [2020-12-23 16:17:34,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:17:34,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332215074] [2020-12-23 16:17:34,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:17:35,023 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:17:35,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1295325457] [2020-12-23 16:17:35,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:17:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:17:35,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:17:35,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:17:35,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 16:17:35,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332215074] [2020-12-23 16:17:35,468 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:17:35,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295325457] [2020-12-23 16:17:35,468 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:17:35,468 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 16:17:35,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111053599] [2020-12-23 16:17:35,469 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:17:35,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:17:35,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:17:35,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:17:35,470 INFO L87 Difference]: Start difference. First operand 493 states and 629 transitions. Second operand 4 states. [2020-12-23 16:17:35,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:17:35,589 INFO L93 Difference]: Finished difference Result 761 states and 972 transitions. [2020-12-23 16:17:35,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:17:35,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2020-12-23 16:17:35,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:17:35,593 INFO L225 Difference]: With dead ends: 761 [2020-12-23 16:17:35,594 INFO L226 Difference]: Without dead ends: 480 [2020-12-23 16:17:35,595 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:17:35,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2020-12-23 16:17:35,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 479. [2020-12-23 16:17:35,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2020-12-23 16:17:35,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 608 transitions. [2020-12-23 16:17:35,609 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 608 transitions. Word has length 97 [2020-12-23 16:17:35,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:17:35,610 INFO L481 AbstractCegarLoop]: Abstraction has 479 states and 608 transitions. [2020-12-23 16:17:35,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:17:35,610 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 608 transitions. [2020-12-23 16:17:35,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-23 16:17:35,611 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:17:35,612 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:17:35,825 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:17:35,826 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:17:35,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:17:35,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1427704734, now seen corresponding path program 1 times [2020-12-23 16:17:35,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:17:35,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618525448] [2020-12-23 16:17:35,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:17:35,849 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:17:35,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [906841674] [2020-12-23 16:17:35,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:17:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:17:36,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 16:17:36,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:17:36,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:17:36,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618525448] [2020-12-23 16:17:36,376 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:17:36,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906841674] [2020-12-23 16:17:36,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:17:36,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:17:36,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444861421] [2020-12-23 16:17:36,378 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:17:36,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:17:36,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:17:36,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:17:36,379 INFO L87 Difference]: Start difference. First operand 479 states and 608 transitions. Second operand 3 states. [2020-12-23 16:17:36,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:17:36,486 INFO L93 Difference]: Finished difference Result 1231 states and 1562 transitions. [2020-12-23 16:17:36,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:17:36,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2020-12-23 16:17:36,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:17:36,491 INFO L225 Difference]: With dead ends: 1231 [2020-12-23 16:17:36,492 INFO L226 Difference]: Without dead ends: 756 [2020-12-23 16:17:36,494 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:17:36,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2020-12-23 16:17:36,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 721. [2020-12-23 16:17:36,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2020-12-23 16:17:36,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 930 transitions. [2020-12-23 16:17:36,524 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 930 transitions. Word has length 97 [2020-12-23 16:17:36,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:17:36,525 INFO L481 AbstractCegarLoop]: Abstraction has 721 states and 930 transitions. [2020-12-23 16:17:36,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:17:36,525 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 930 transitions. [2020-12-23 16:17:36,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-12-23 16:17:36,526 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:17:36,527 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:17:36,740 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-23 16:17:36,741 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:17:36,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:17:36,742 INFO L82 PathProgramCache]: Analyzing trace with hash -371205377, now seen corresponding path program 1 times [2020-12-23 16:17:36,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:17:36,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760114325] [2020-12-23 16:17:36,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:17:36,765 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:17:36,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1340842973] [2020-12-23 16:17:36,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:17:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:17:37,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:17:37,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:17:37,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:17:37,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760114325] [2020-12-23 16:17:37,275 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:17:37,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340842973] [2020-12-23 16:17:37,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:17:37,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:17:37,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274436972] [2020-12-23 16:17:37,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:17:37,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:17:37,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:17:37,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:17:37,278 INFO L87 Difference]: Start difference. First operand 721 states and 930 transitions. Second operand 3 states. [2020-12-23 16:17:37,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:17:37,348 INFO L93 Difference]: Finished difference Result 1400 states and 1809 transitions. [2020-12-23 16:17:37,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:17:37,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2020-12-23 16:17:37,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:17:37,353 INFO L225 Difference]: With dead ends: 1400 [2020-12-23 16:17:37,353 INFO L226 Difference]: Without dead ends: 727 [2020-12-23 16:17:37,355 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:17:37,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2020-12-23 16:17:37,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2020-12-23 16:17:37,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2020-12-23 16:17:37,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 936 transitions. [2020-12-23 16:17:37,379 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 936 transitions. Word has length 104 [2020-12-23 16:17:37,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:17:37,379 INFO L481 AbstractCegarLoop]: Abstraction has 727 states and 936 transitions. [2020-12-23 16:17:37,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:17:37,379 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 936 transitions. [2020-12-23 16:17:37,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 16:17:37,381 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:17:37,381 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:17:37,595 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:17:37,596 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:17:37,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:17:37,598 INFO L82 PathProgramCache]: Analyzing trace with hash -2085853600, now seen corresponding path program 1 times [2020-12-23 16:17:37,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:17:37,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705080423] [2020-12-23 16:17:37,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:17:37,618 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:17:37,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1407122470] [2020-12-23 16:17:37,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:17:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:17:38,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 16:17:38,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:17:38,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 16:17:38,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705080423] [2020-12-23 16:17:38,168 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:17:38,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407122470] [2020-12-23 16:17:38,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:17:38,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-12-23 16:17:38,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407248773] [2020-12-23 16:17:38,170 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:17:38,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:17:38,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:17:38,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:17:38,171 INFO L87 Difference]: Start difference. First operand 727 states and 936 transitions. Second operand 4 states. [2020-12-23 16:17:38,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:17:38,266 INFO L93 Difference]: Finished difference Result 1411 states and 1820 transitions. [2020-12-23 16:17:38,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:17:38,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2020-12-23 16:17:38,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:17:38,271 INFO L225 Difference]: With dead ends: 1411 [2020-12-23 16:17:38,271 INFO L226 Difference]: Without dead ends: 733 [2020-12-23 16:17:38,273 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:17:38,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2020-12-23 16:17:38,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2020-12-23 16:17:38,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2020-12-23 16:17:38,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 942 transitions. [2020-12-23 16:17:38,296 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 942 transitions. Word has length 106 [2020-12-23 16:17:38,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:17:38,296 INFO L481 AbstractCegarLoop]: Abstraction has 733 states and 942 transitions. [2020-12-23 16:17:38,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:17:38,296 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 942 transitions. [2020-12-23 16:17:38,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-12-23 16:17:38,298 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:17:38,298 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:17:38,511 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:17:38,512 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:17:38,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:17:38,513 INFO L82 PathProgramCache]: Analyzing trace with hash -462744993, now seen corresponding path program 2 times [2020-12-23 16:17:38,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:17:38,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968329275] [2020-12-23 16:17:38,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:17:38,530 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:17:38,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1914346663] [2020-12-23 16:17:38,531 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:17:39,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 16:17:39,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:17:39,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 16:17:39,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:17:39,857 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 16:17:39,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968329275] [2020-12-23 16:17:39,858 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:17:39,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914346663] [2020-12-23 16:17:39,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:17:39,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-12-23 16:17:39,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866603296] [2020-12-23 16:17:39,859 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 16:17:39,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:17:39,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 16:17:39,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:17:39,860 INFO L87 Difference]: Start difference. First operand 733 states and 942 transitions. Second operand 5 states. [2020-12-23 16:17:40,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:17:40,014 INFO L93 Difference]: Finished difference Result 1422 states and 1831 transitions. [2020-12-23 16:17:40,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 16:17:40,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2020-12-23 16:17:40,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:17:40,019 INFO L225 Difference]: With dead ends: 1422 [2020-12-23 16:17:40,019 INFO L226 Difference]: Without dead ends: 739 [2020-12-23 16:17:40,021 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:17:40,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2020-12-23 16:17:40,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2020-12-23 16:17:40,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2020-12-23 16:17:40,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 948 transitions. [2020-12-23 16:17:40,049 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 948 transitions. Word has length 108 [2020-12-23 16:17:40,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:17:40,049 INFO L481 AbstractCegarLoop]: Abstraction has 739 states and 948 transitions. [2020-12-23 16:17:40,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 16:17:40,049 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 948 transitions. [2020-12-23 16:17:40,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-12-23 16:17:40,051 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:17:40,051 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:17:40,259 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-23 16:17:40,260 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:17:40,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:17:40,260 INFO L82 PathProgramCache]: Analyzing trace with hash 87417216, now seen corresponding path program 3 times [2020-12-23 16:17:40,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:17:40,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173112747] [2020-12-23 16:17:40,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:17:40,292 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:17:40,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [82460791] [2020-12-23 16:17:40,293 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:17:41,072 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-23 16:17:41,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:17:41,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-23 16:17:41,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:17:41,128 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 16:17:41,129 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:17:41,135 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:17:41,139 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 16:17:41,140 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:17:41,144 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:17:41,145 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:17:41,146 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:13 [2020-12-23 16:17:41,171 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:17:41,172 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-23 16:17:41,176 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:17:41,180 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:17:41,185 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:17:41,186 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:17:41,186 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2020-12-23 16:17:41,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:17:41,221 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-23 16:17:41,222 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:17:41,227 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:17:41,229 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:17:41,229 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:70, output treesize:3 [2020-12-23 16:17:41,300 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 16:17:41,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173112747] [2020-12-23 16:17:41,301 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:17:41,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82460791] [2020-12-23 16:17:41,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:17:41,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 16:17:41,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964733469] [2020-12-23 16:17:41,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 16:17:41,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:17:41,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 16:17:41,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:17:41,303 INFO L87 Difference]: Start difference. First operand 739 states and 948 transitions. Second operand 5 states. [2020-12-23 16:17:42,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:17:42,482 INFO L93 Difference]: Finished difference Result 1382 states and 1772 transitions. [2020-12-23 16:17:42,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 16:17:42,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2020-12-23 16:17:42,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:17:42,487 INFO L225 Difference]: With dead ends: 1382 [2020-12-23 16:17:42,488 INFO L226 Difference]: Without dead ends: 739 [2020-12-23 16:17:42,489 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 16:17:42,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2020-12-23 16:17:42,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2020-12-23 16:17:42,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2020-12-23 16:17:42,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 947 transitions. [2020-12-23 16:17:42,515 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 947 transitions. Word has length 110 [2020-12-23 16:17:42,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:17:42,515 INFO L481 AbstractCegarLoop]: Abstraction has 739 states and 947 transitions. [2020-12-23 16:17:42,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 16:17:42,516 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 947 transitions. [2020-12-23 16:17:42,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-12-23 16:17:42,518 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:17:42,518 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:17:42,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:17:42,733 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:17:42,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:17:42,734 INFO L82 PathProgramCache]: Analyzing trace with hash -2117457625, now seen corresponding path program 1 times [2020-12-23 16:17:42,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:17:42,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592715801] [2020-12-23 16:17:42,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:17:42,760 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:17:42,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [745662154] [2020-12-23 16:17:42,761 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:17:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:17:43,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:17:43,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:17:43,417 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 16:17:43,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592715801] [2020-12-23 16:17:43,418 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:17:43,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745662154] [2020-12-23 16:17:43,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:17:43,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:17:43,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867685631] [2020-12-23 16:17:43,419 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:17:43,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:17:43,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:17:43,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:17:43,420 INFO L87 Difference]: Start difference. First operand 739 states and 947 transitions. Second operand 3 states. [2020-12-23 16:17:43,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:17:43,557 INFO L93 Difference]: Finished difference Result 1502 states and 1935 transitions. [2020-12-23 16:17:43,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:17:43,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2020-12-23 16:17:43,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:17:43,561 INFO L225 Difference]: With dead ends: 1502 [2020-12-23 16:17:43,562 INFO L226 Difference]: Without dead ends: 781 [2020-12-23 16:17:43,563 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:17:43,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2020-12-23 16:17:43,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 779. [2020-12-23 16:17:43,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-12-23 16:17:43,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 987 transitions. [2020-12-23 16:17:43,587 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 987 transitions. Word has length 157 [2020-12-23 16:17:43,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:17:43,587 INFO L481 AbstractCegarLoop]: Abstraction has 779 states and 987 transitions. [2020-12-23 16:17:43,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:17:43,588 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 987 transitions. [2020-12-23 16:17:43,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-12-23 16:17:43,590 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:17:43,590 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:17:43,803 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:17:43,804 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:17:43,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:17:43,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1572585051, now seen corresponding path program 1 times [2020-12-23 16:17:43,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:17:43,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641569521] [2020-12-23 16:17:43,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:17:43,826 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:17:43,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [283064772] [2020-12-23 16:17:43,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:17:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:17:44,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:17:44,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:17:44,417 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 16:17:44,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641569521] [2020-12-23 16:17:44,422 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:17:44,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283064772] [2020-12-23 16:17:44,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:17:44,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 16:17:44,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725961368] [2020-12-23 16:17:44,423 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:17:44,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:17:44,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:17:44,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:17:44,425 INFO L87 Difference]: Start difference. First operand 779 states and 987 transitions. Second operand 4 states. [2020-12-23 16:17:44,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:17:44,536 INFO L93 Difference]: Finished difference Result 1496 states and 1900 transitions. [2020-12-23 16:17:44,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:17:44,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2020-12-23 16:17:44,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:17:44,541 INFO L225 Difference]: With dead ends: 1496 [2020-12-23 16:17:44,541 INFO L226 Difference]: Without dead ends: 753 [2020-12-23 16:17:44,542 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:17:44,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2020-12-23 16:17:44,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 751. [2020-12-23 16:17:44,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2020-12-23 16:17:44,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 945 transitions. [2020-12-23 16:17:44,604 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 945 transitions. Word has length 157 [2020-12-23 16:17:44,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:17:44,604 INFO L481 AbstractCegarLoop]: Abstraction has 751 states and 945 transitions. [2020-12-23 16:17:44,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:17:44,604 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 945 transitions. [2020-12-23 16:17:44,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-12-23 16:17:44,607 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:17:44,607 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:17:44,822 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-12-23 16:17:44,822 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:17:44,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:17:44,823 INFO L82 PathProgramCache]: Analyzing trace with hash 94293941, now seen corresponding path program 1 times [2020-12-23 16:17:44,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:17:44,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488356356] [2020-12-23 16:17:44,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:17:44,855 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:17:44,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1433551377] [2020-12-23 16:17:44,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:17:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:17:45,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 16:17:45,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:17:45,441 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 16:17:45,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488356356] [2020-12-23 16:17:45,442 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:17:45,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433551377] [2020-12-23 16:17:45,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:17:45,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 16:17:45,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93083863] [2020-12-23 16:17:45,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 16:17:45,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:17:45,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 16:17:45,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:17:45,444 INFO L87 Difference]: Start difference. First operand 751 states and 945 transitions. Second operand 5 states. [2020-12-23 16:17:45,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:17:45,626 INFO L93 Difference]: Finished difference Result 2209 states and 2786 transitions. [2020-12-23 16:17:45,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 16:17:45,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2020-12-23 16:17:45,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:17:45,634 INFO L225 Difference]: With dead ends: 2209 [2020-12-23 16:17:45,634 INFO L226 Difference]: Without dead ends: 1496 [2020-12-23 16:17:45,636 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:17:45,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2020-12-23 16:17:45,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 797. [2020-12-23 16:17:45,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-12-23 16:17:45,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 995 transitions. [2020-12-23 16:17:45,669 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 995 transitions. Word has length 157 [2020-12-23 16:17:45,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:17:45,670 INFO L481 AbstractCegarLoop]: Abstraction has 797 states and 995 transitions. [2020-12-23 16:17:45,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 16:17:45,670 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 995 transitions. [2020-12-23 16:17:45,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-12-23 16:17:45,672 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:17:45,673 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:17:45,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-12-23 16:17:45,887 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:17:45,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:17:45,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1994860229, now seen corresponding path program 1 times [2020-12-23 16:17:45,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:17:45,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161787370] [2020-12-23 16:17:45,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:17:45,906 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:17:45,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [217678930] [2020-12-23 16:17:45,907 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:17:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:17:46,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 16:17:46,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:17:46,527 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 16:17:46,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161787370] [2020-12-23 16:17:46,527 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:17:46,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217678930] [2020-12-23 16:17:46,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:17:46,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 16:17:46,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726667466] [2020-12-23 16:17:46,530 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:17:46,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:17:46,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:17:46,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:17:46,531 INFO L87 Difference]: Start difference. First operand 797 states and 995 transitions. Second operand 4 states. [2020-12-23 16:17:46,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:17:46,602 INFO L93 Difference]: Finished difference Result 1503 states and 1887 transitions. [2020-12-23 16:17:46,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:17:46,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2020-12-23 16:17:46,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:17:46,606 INFO L225 Difference]: With dead ends: 1503 [2020-12-23 16:17:46,606 INFO L226 Difference]: Without dead ends: 733 [2020-12-23 16:17:46,609 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:17:46,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2020-12-23 16:17:46,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2020-12-23 16:17:46,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2020-12-23 16:17:46,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 917 transitions. [2020-12-23 16:17:46,635 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 917 transitions. Word has length 157 [2020-12-23 16:17:46,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:17:46,636 INFO L481 AbstractCegarLoop]: Abstraction has 733 states and 917 transitions. [2020-12-23 16:17:46,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:17:46,636 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 917 transitions. [2020-12-23 16:17:46,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-12-23 16:17:46,638 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:17:46,638 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:17:46,853 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-12-23 16:17:46,854 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:17:46,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:17:46,855 INFO L82 PathProgramCache]: Analyzing trace with hash 639166515, now seen corresponding path program 1 times [2020-12-23 16:17:46,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:17:46,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672773692] [2020-12-23 16:17:46,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:17:46,876 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:17:46,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [710562647] [2020-12-23 16:17:46,877 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:17:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:17:47,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-23 16:17:47,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:17:47,498 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-23 16:17:47,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672773692] [2020-12-23 16:17:47,499 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:17:47,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710562647] [2020-12-23 16:17:47,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:17:47,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-12-23 16:17:47,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645440367] [2020-12-23 16:17:47,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 16:17:47,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:17:47,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 16:17:47,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 16:17:47,501 INFO L87 Difference]: Start difference. First operand 733 states and 917 transitions. Second operand 6 states. [2020-12-23 16:17:47,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:17:47,608 INFO L93 Difference]: Finished difference Result 1424 states and 1796 transitions. [2020-12-23 16:17:47,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 16:17:47,608 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 157 [2020-12-23 16:17:47,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:17:47,613 INFO L225 Difference]: With dead ends: 1424 [2020-12-23 16:17:47,613 INFO L226 Difference]: Without dead ends: 739 [2020-12-23 16:17:47,614 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 16:17:47,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2020-12-23 16:17:47,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2020-12-23 16:17:47,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2020-12-23 16:17:47,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 923 transitions. [2020-12-23 16:17:47,643 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 923 transitions. Word has length 157 [2020-12-23 16:17:47,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:17:47,643 INFO L481 AbstractCegarLoop]: Abstraction has 739 states and 923 transitions. [2020-12-23 16:17:47,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 16:17:47,643 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 923 transitions. [2020-12-23 16:17:47,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-12-23 16:17:47,646 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:17:47,646 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:17:47,861 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:17:47,862 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:17:47,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:17:47,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1050888114, now seen corresponding path program 2 times [2020-12-23 16:17:47,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:17:47,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43992965] [2020-12-23 16:17:47,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:17:47,883 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:17:47,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [862165770] [2020-12-23 16:17:47,884 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:17:48,365 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 16:17:48,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:17:48,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-23 16:17:48,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:17:48,592 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-23 16:17:48,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43992965] [2020-12-23 16:17:48,592 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:17:48,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862165770] [2020-12-23 16:17:48,592 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:17:48,592 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-12-23 16:17:48,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132249917] [2020-12-23 16:17:48,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 16:17:48,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:17:48,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 16:17:48,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-23 16:17:48,594 INFO L87 Difference]: Start difference. First operand 739 states and 923 transitions. Second operand 7 states. [2020-12-23 16:17:48,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:17:48,724 INFO L93 Difference]: Finished difference Result 1435 states and 1807 transitions. [2020-12-23 16:17:48,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 16:17:48,725 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 159 [2020-12-23 16:17:48,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:17:48,729 INFO L225 Difference]: With dead ends: 1435 [2020-12-23 16:17:48,730 INFO L226 Difference]: Without dead ends: 745 [2020-12-23 16:17:48,731 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-23 16:17:48,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2020-12-23 16:17:48,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2020-12-23 16:17:48,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2020-12-23 16:17:48,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 929 transitions. [2020-12-23 16:17:48,757 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 929 transitions. Word has length 159 [2020-12-23 16:17:48,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:17:48,758 INFO L481 AbstractCegarLoop]: Abstraction has 745 states and 929 transitions. [2020-12-23 16:17:48,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 16:17:48,758 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 929 transitions. [2020-12-23 16:17:48,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-12-23 16:17:48,760 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:17:48,760 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:17:48,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-12-23 16:17:48,975 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:17:48,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:17:48,976 INFO L82 PathProgramCache]: Analyzing trace with hash 770488787, now seen corresponding path program 3 times [2020-12-23 16:17:48,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:17:48,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610898651] [2020-12-23 16:17:48,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:17:49,006 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:17:49,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [350888310] [2020-12-23 16:17:49,007 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:17:49,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-23 16:17:49,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:17:49,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 16:17:49,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:17:49,733 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-23 16:17:49,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610898651] [2020-12-23 16:17:49,734 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:17:49,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350888310] [2020-12-23 16:17:49,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:17:49,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:17:49,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007585766] [2020-12-23 16:17:49,735 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:17:49,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:17:49,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:17:49,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:17:49,736 INFO L87 Difference]: Start difference. First operand 745 states and 929 transitions. Second operand 3 states. [2020-12-23 16:17:49,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:17:49,864 INFO L93 Difference]: Finished difference Result 1749 states and 2217 transitions. [2020-12-23 16:17:49,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:17:49,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2020-12-23 16:17:49,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:17:49,870 INFO L225 Difference]: With dead ends: 1749 [2020-12-23 16:17:49,870 INFO L226 Difference]: Without dead ends: 1063 [2020-12-23 16:17:49,871 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:17:49,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2020-12-23 16:17:49,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 906. [2020-12-23 16:17:49,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2020-12-23 16:17:49,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1156 transitions. [2020-12-23 16:17:49,904 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1156 transitions. Word has length 161 [2020-12-23 16:17:49,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:17:49,904 INFO L481 AbstractCegarLoop]: Abstraction has 906 states and 1156 transitions. [2020-12-23 16:17:49,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:17:49,904 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1156 transitions. [2020-12-23 16:17:49,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-12-23 16:17:49,906 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:17:49,907 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:17:50,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-23 16:17:50,112 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:17:50,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:17:50,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1484056676, now seen corresponding path program 1 times [2020-12-23 16:17:50,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:17:50,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136172711] [2020-12-23 16:17:50,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:17:50,135 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:17:50,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1595122983] [2020-12-23 16:17:50,136 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:17:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:17:50,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-23 16:17:50,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:17:50,956 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2020-12-23 16:17:50,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136172711] [2020-12-23 16:17:50,957 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:17:50,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595122983] [2020-12-23 16:17:50,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:17:50,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-12-23 16:17:50,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359174350] [2020-12-23 16:17:50,958 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 16:17:50,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:17:50,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 16:17:50,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-12-23 16:17:50,959 INFO L87 Difference]: Start difference. First operand 906 states and 1156 transitions. Second operand 8 states. [2020-12-23 16:17:51,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:17:51,096 INFO L93 Difference]: Finished difference Result 1770 states and 2275 transitions. [2020-12-23 16:17:51,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 16:17:51,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 178 [2020-12-23 16:17:51,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:17:51,101 INFO L225 Difference]: With dead ends: 1770 [2020-12-23 16:17:51,101 INFO L226 Difference]: Without dead ends: 912 [2020-12-23 16:17:51,103 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-12-23 16:17:51,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2020-12-23 16:17:51,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 912. [2020-12-23 16:17:51,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 912 states. [2020-12-23 16:17:51,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1162 transitions. [2020-12-23 16:17:51,133 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1162 transitions. Word has length 178 [2020-12-23 16:17:51,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:17:51,133 INFO L481 AbstractCegarLoop]: Abstraction has 912 states and 1162 transitions. [2020-12-23 16:17:51,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 16:17:51,133 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1162 transitions. [2020-12-23 16:17:51,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-12-23 16:17:51,135 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:17:51,136 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:17:51,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:17:51,350 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:17:51,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:17:51,351 INFO L82 PathProgramCache]: Analyzing trace with hash -453644734, now seen corresponding path program 2 times [2020-12-23 16:17:51,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:17:51,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388067725] [2020-12-23 16:17:51,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:17:51,377 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:17:51,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1756285360] [2020-12-23 16:17:51,377 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:17:51,938 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 16:17:51,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:17:51,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-23 16:17:51,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:17:52,175 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2020-12-23 16:17:52,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388067725] [2020-12-23 16:17:52,176 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:17:52,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756285360] [2020-12-23 16:17:52,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:17:52,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-12-23 16:17:52,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080531002] [2020-12-23 16:17:52,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 16:17:52,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:17:52,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 16:17:52,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-12-23 16:17:52,178 INFO L87 Difference]: Start difference. First operand 912 states and 1162 transitions. Second operand 9 states. [2020-12-23 16:17:52,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:17:52,325 INFO L93 Difference]: Finished difference Result 1781 states and 2286 transitions. [2020-12-23 16:17:52,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 16:17:52,326 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 182 [2020-12-23 16:17:52,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:17:52,330 INFO L225 Difference]: With dead ends: 1781 [2020-12-23 16:17:52,331 INFO L226 Difference]: Without dead ends: 918 [2020-12-23 16:17:52,332 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-12-23 16:17:52,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2020-12-23 16:17:52,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 918. [2020-12-23 16:17:52,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918 states. [2020-12-23 16:17:52,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1168 transitions. [2020-12-23 16:17:52,363 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1168 transitions. Word has length 182 [2020-12-23 16:17:52,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:17:52,363 INFO L481 AbstractCegarLoop]: Abstraction has 918 states and 1168 transitions. [2020-12-23 16:17:52,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 16:17:52,363 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1168 transitions. [2020-12-23 16:17:52,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2020-12-23 16:17:52,366 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:17:52,366 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:17:52,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:17:52,582 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:17:52,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:17:52,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1986963428, now seen corresponding path program 3 times [2020-12-23 16:17:52,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:17:52,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296055249] [2020-12-23 16:17:52,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:17:52,601 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:17:52,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1597084224] [2020-12-23 16:17:52,602 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:17:53,213 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-23 16:17:53,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:17:53,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-23 16:17:53,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:17:53,542 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2020-12-23 16:17:53,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296055249] [2020-12-23 16:17:53,542 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:17:53,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597084224] [2020-12-23 16:17:53,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:17:53,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 16:17:53,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874006450] [2020-12-23 16:17:53,544 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:17:53,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:17:53,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:17:53,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:17:53,545 INFO L87 Difference]: Start difference. First operand 918 states and 1168 transitions. Second operand 4 states. [2020-12-23 16:17:54,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:17:54,095 INFO L93 Difference]: Finished difference Result 1509 states and 1921 transitions. [2020-12-23 16:17:54,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:17:54,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2020-12-23 16:17:54,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:17:54,099 INFO L225 Difference]: With dead ends: 1509 [2020-12-23 16:17:54,099 INFO L226 Difference]: Without dead ends: 732 [2020-12-23 16:17:54,100 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:17:54,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2020-12-23 16:17:54,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2020-12-23 16:17:54,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2020-12-23 16:17:54,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 909 transitions. [2020-12-23 16:17:54,126 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 909 transitions. Word has length 186 [2020-12-23 16:17:54,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:17:54,127 INFO L481 AbstractCegarLoop]: Abstraction has 732 states and 909 transitions. [2020-12-23 16:17:54,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:17:54,127 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 909 transitions. [2020-12-23 16:17:54,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-12-23 16:17:54,129 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:17:54,130 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:17:54,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:17:54,344 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:17:54,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:17:54,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1622468887, now seen corresponding path program 1 times [2020-12-23 16:17:54,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:17:54,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514010266] [2020-12-23 16:17:54,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:17:54,363 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:17:54,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [645137132] [2020-12-23 16:17:54,363 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:17:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:17:54,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-23 16:17:54,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:17:55,192 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-12-23 16:17:55,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514010266] [2020-12-23 16:17:55,192 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:17:55,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645137132] [2020-12-23 16:17:55,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:17:55,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-12-23 16:17:55,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083952656] [2020-12-23 16:17:55,193 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 16:17:55,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:17:55,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 16:17:55,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-12-23 16:17:55,194 INFO L87 Difference]: Start difference. First operand 732 states and 909 transitions. Second operand 10 states. [2020-12-23 16:17:55,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:17:55,338 INFO L93 Difference]: Finished difference Result 1418 states and 1775 transitions. [2020-12-23 16:17:55,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 16:17:55,339 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 193 [2020-12-23 16:17:55,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:17:55,342 INFO L225 Difference]: With dead ends: 1418 [2020-12-23 16:17:55,343 INFO L226 Difference]: Without dead ends: 736 [2020-12-23 16:17:55,344 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-12-23 16:17:55,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2020-12-23 16:17:55,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 736. [2020-12-23 16:17:55,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2020-12-23 16:17:55,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 913 transitions. [2020-12-23 16:17:55,371 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 913 transitions. Word has length 193 [2020-12-23 16:17:55,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:17:55,372 INFO L481 AbstractCegarLoop]: Abstraction has 736 states and 913 transitions. [2020-12-23 16:17:55,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 16:17:55,372 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 913 transitions. [2020-12-23 16:17:55,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2020-12-23 16:17:55,373 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:17:55,373 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:17:55,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2020-12-23 16:17:55,589 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:17:55,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:17:55,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1336921525, now seen corresponding path program 2 times [2020-12-23 16:17:55,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:17:55,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467523753] [2020-12-23 16:17:55,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:17:55,611 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:17:55,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [781434037] [2020-12-23 16:17:55,612 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:17:56,346 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 16:17:56,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:17:56,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-23 16:17:56,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:17:56,628 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2020-12-23 16:17:56,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467523753] [2020-12-23 16:17:56,628 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:17:56,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781434037] [2020-12-23 16:17:56,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:17:56,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-12-23 16:17:56,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269056749] [2020-12-23 16:17:56,629 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 16:17:56,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:17:56,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 16:17:56,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-12-23 16:17:56,630 INFO L87 Difference]: Start difference. First operand 736 states and 913 transitions. Second operand 11 states. [2020-12-23 16:17:56,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:17:56,802 INFO L93 Difference]: Finished difference Result 1425 states and 1782 transitions. [2020-12-23 16:17:56,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-23 16:17:56,803 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 197 [2020-12-23 16:17:56,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:17:56,807 INFO L225 Difference]: With dead ends: 1425 [2020-12-23 16:17:56,807 INFO L226 Difference]: Without dead ends: 740 [2020-12-23 16:17:56,809 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-12-23 16:17:56,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2020-12-23 16:17:56,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2020-12-23 16:17:56,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2020-12-23 16:17:56,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 917 transitions. [2020-12-23 16:17:56,837 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 917 transitions. Word has length 197 [2020-12-23 16:17:56,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:17:56,837 INFO L481 AbstractCegarLoop]: Abstraction has 740 states and 917 transitions. [2020-12-23 16:17:56,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 16:17:56,837 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 917 transitions. [2020-12-23 16:17:56,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2020-12-23 16:17:56,839 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:17:56,839 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:17:57,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2020-12-23 16:17:57,046 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:17:57,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:17:57,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1628837737, now seen corresponding path program 3 times [2020-12-23 16:17:57,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:17:57,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158093281] [2020-12-23 16:17:57,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:17:57,071 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:17:57,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [844337345] [2020-12-23 16:17:57,071 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true