/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_SAX_test5-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 16:27:33,356 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 16:27:33,360 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 16:27:33,420 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 16:27:33,421 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 16:27:33,425 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 16:27:33,430 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 16:27:33,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 16:27:33,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 16:27:33,464 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 16:27:33,469 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 16:27:33,471 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 16:27:33,471 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 16:27:33,474 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 16:27:33,476 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 16:27:33,478 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 16:27:33,479 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 16:27:33,482 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 16:27:33,489 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 16:27:33,497 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 16:27:33,499 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 16:27:33,501 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 16:27:33,503 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 16:27:33,505 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 16:27:33,513 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 16:27:33,514 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 16:27:33,514 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 16:27:33,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 16:27:33,517 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 16:27:33,518 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 16:27:33,518 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 16:27:33,519 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 16:27:33,521 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 16:27:33,522 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 16:27:33,523 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 16:27:33,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 16:27:33,524 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 16:27:33,532 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 16:27:33,533 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 16:27:33,534 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 16:27:33,535 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 16:27:33,536 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:27:33,581 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 16:27:33,582 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 16:27:33,585 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 16:27:33,585 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 16:27:33,586 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 16:27:33,586 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 16:27:33,586 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 16:27:33,586 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 16:27:33,587 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 16:27:33,587 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 16:27:33,588 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 16:27:33,588 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 16:27:33,588 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 16:27:33,589 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 16:27:33,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 16:27:33,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 16:27:33,589 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 16:27:33,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 16:27:33,590 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 16:27:33,590 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 16:27:33,590 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 16:27:33,590 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 16:27:33,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 16:27:33,591 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 16:27:33,591 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 16:27:33,591 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:27:34,023 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 16:27:34,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 16:27:34,065 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 16:27:34,066 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 16:27:34,067 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 16:27:34,068 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_SAX_test5-2.i [2020-12-23 16:27:34,148 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/95c85bc9f/09d4f948403e457abf7fd0e143d0c68c/FLAGf9636f428 [2020-12-23 16:27:34,950 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 16:27:34,951 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-2.i [2020-12-23 16:27:34,986 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/95c85bc9f/09d4f948403e457abf7fd0e143d0c68c/FLAGf9636f428 [2020-12-23 16:27:35,155 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/95c85bc9f/09d4f948403e457abf7fd0e143d0c68c [2020-12-23 16:27:35,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 16:27:35,162 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 16:27:35,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 16:27:35,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 16:27:35,170 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 16:27:35,171 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 04:27:35" (1/1) ... [2020-12-23 16:27:35,173 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42dc447a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:27:35, skipping insertion in model container [2020-12-23 16:27:35,173 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 04:27:35" (1/1) ... [2020-12-23 16:27:35,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 16:27:35,270 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 16:27:35,813 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_SAX_test5-2.i[33021,33034] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],StructAccessExpression[IdentifierExpression[~user~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem37,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem37,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem38,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem38,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem39,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem39,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem40,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem40,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem41,],base],StructAccessExpression[IdentifierExpression[#t~mem41,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem43,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem43,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem56,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem56,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem57,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem57,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem69,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem69,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~0,],base],StructAccessExpression[IdentifierExpression[~_ha_head~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_new_buckets~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem81,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem81,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem91,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem91,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem117,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem117,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem125,],base],StructAccessExpression[IdentifierExpression[#t~mem125,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem126,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem126,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem136,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem136,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[104],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem165,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem165,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem166,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem166,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem167,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem167,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem168,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem168,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,],base],StructAccessExpression[IdentifierExpression[#t~mem169,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem171,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem171,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~altusers~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem184,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem184,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem185,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem185,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem197,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem197,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~1,],base],StructAccessExpression[IdentifierExpression[~_ha_head~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_new_buckets~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem209,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem209,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem219,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem219,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem245,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem245,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem253,],base],StructAccessExpression[IdentifierExpression[#t~mem253,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem254,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem254,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem264,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem264,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] [2020-12-23 16:27:36,056 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_SAX_test5-2.i[49681,49694] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem322,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem322,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem327,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem327,],offset],IdentifierExpression[#t~mem329,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem333,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem333,],offset],IdentifierExpression[#t~mem335,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~0,],base],StructAccessExpression[IdentifierExpression[~_hd_head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem347,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem347,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem350,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem350,],offset]]]] [2020-12-23 16:27:36,080 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 16:27:36,090 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 16:27:36,122 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_SAX_test5-2.i[33021,33034] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],StructAccessExpression[IdentifierExpression[~user~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem37,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem37,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem38,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem38,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem39,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem39,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem40,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem40,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem41,],base],StructAccessExpression[IdentifierExpression[#t~mem41,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem43,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem43,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem56,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem56,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem57,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem57,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem69,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem69,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~0,],base],StructAccessExpression[IdentifierExpression[~_ha_head~0,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~#_he_new_buckets~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem83,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem83,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem93,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem93,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem120,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem120,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem128,],base],StructAccessExpression[IdentifierExpression[#t~mem128,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem130,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem130,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem140,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem140,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[104],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem169,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem170,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem170,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem171,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem171,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem172,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem172,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem173,],base],StructAccessExpression[IdentifierExpression[#t~mem173,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem175,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem175,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~altusers~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem188,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem188,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem189,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem189,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem201,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem201,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~1,],base],StructAccessExpression[IdentifierExpression[~_ha_head~1,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~#_he_new_buckets~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem215,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem215,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem225,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem225,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem252,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem252,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem260,],base],StructAccessExpression[IdentifierExpression[#t~mem260,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem262,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem262,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem272,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem272,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: IdentifierExpression[~#j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] [2020-12-23 16:27:36,315 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_SAX_test5-2.i[49681,49694] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem330,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem330,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem335,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem335,],offset],IdentifierExpression[#t~mem337,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem341,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem341,],offset],IdentifierExpression[#t~mem343,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~0,],base],StructAccessExpression[IdentifierExpression[~_hd_head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem355,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem355,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem358,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem358,],offset]]]] [2020-12-23 16:27:36,337 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 16:27:36,448 INFO L208 MainTranslator]: Completed translation [2020-12-23 16:27:36,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:27:36 WrapperNode [2020-12-23 16:27:36,450 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 16:27:36,452 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 16:27:36,452 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 16:27:36,454 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 16:27:36,463 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:27:36" (1/1) ... [2020-12-23 16:27:36,551 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:27:36" (1/1) ... [2020-12-23 16:27:36,659 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 16:27:36,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 16:27:36,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 16:27:36,661 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 16:27:36,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:27:36" (1/1) ... [2020-12-23 16:27:36,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:27:36" (1/1) ... [2020-12-23 16:27:36,682 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:27:36" (1/1) ... [2020-12-23 16:27:36,682 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:27:36" (1/1) ... [2020-12-23 16:27:36,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:27:36" (1/1) ... [2020-12-23 16:27:36,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:27:36" (1/1) ... [2020-12-23 16:27:36,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:27:36" (1/1) ... [2020-12-23 16:27:36,846 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 16:27:36,847 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 16:27:36,847 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 16:27:36,847 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 16:27:36,848 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:27:36" (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:27:36,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 16:27:36,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 16:27:36,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 16:27:36,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 16:27:36,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 16:27:36,941 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2020-12-23 16:27:36,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 16:27:36,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 16:27:36,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 16:27:36,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 16:27:36,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 16:27:39,169 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 16:27:39,169 INFO L299 CfgBuilder]: Removed 120 assume(true) statements. [2020-12-23 16:27:39,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 04:27:39 BoogieIcfgContainer [2020-12-23 16:27:39,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 16:27:39,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 16:27:39,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 16:27:39,177 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 16:27:39,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 04:27:35" (1/3) ... [2020-12-23 16:27:39,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e0457a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 04:27:39, skipping insertion in model container [2020-12-23 16:27:39,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:27:36" (2/3) ... [2020-12-23 16:27:39,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e0457a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 04:27:39, skipping insertion in model container [2020-12-23 16:27:39,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 04:27:39" (3/3) ... [2020-12-23 16:27:39,181 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test5-2.i [2020-12-23 16:27:39,187 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 16:27:39,193 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-12-23 16:27:39,213 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-12-23 16:27:39,243 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 16:27:39,243 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 16:27:39,243 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 16:27:39,243 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 16:27:39,243 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 16:27:39,243 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 16:27:39,244 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 16:27:39,244 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 16:27:39,265 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states. [2020-12-23 16:27:39,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-23 16:27:39,271 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:27:39,272 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:27:39,273 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:27:39,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:27:39,279 INFO L82 PathProgramCache]: Analyzing trace with hash 889803109, now seen corresponding path program 1 times [2020-12-23 16:27:39,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:27:39,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284694148] [2020-12-23 16:27:39,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:27:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:27:39,453 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:27:39,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284694148] [2020-12-23 16:27:39,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:27:39,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 16:27:39,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267096913] [2020-12-23 16:27:39,461 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 16:27:39,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:27:39,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 16:27:39,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 16:27:39,479 INFO L87 Difference]: Start difference. First operand 287 states. Second operand 2 states. [2020-12-23 16:27:39,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:27:39,534 INFO L93 Difference]: Finished difference Result 572 states and 962 transitions. [2020-12-23 16:27:39,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 16:27:39,535 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2020-12-23 16:27:39,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:27:39,552 INFO L225 Difference]: With dead ends: 572 [2020-12-23 16:27:39,553 INFO L226 Difference]: Without dead ends: 254 [2020-12-23 16:27:39,558 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:27:39,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2020-12-23 16:27:39,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2020-12-23 16:27:39,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-12-23 16:27:39,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 333 transitions. [2020-12-23 16:27:39,616 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 333 transitions. Word has length 8 [2020-12-23 16:27:39,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:27:39,616 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 333 transitions. [2020-12-23 16:27:39,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 16:27:39,617 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 333 transitions. [2020-12-23 16:27:39,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-23 16:27:39,619 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:27:39,619 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:27:39,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 16:27:39,620 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:27:39,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:27:39,622 INFO L82 PathProgramCache]: Analyzing trace with hash -680083191, now seen corresponding path program 1 times [2020-12-23 16:27:39,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:27:39,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152603185] [2020-12-23 16:27:39,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:27:39,677 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:27:39,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1865650521] [2020-12-23 16:27:39,678 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:27:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:27:39,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 16:27:39,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:27:39,992 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:27:39,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152603185] [2020-12-23 16:27:39,994 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:27:39,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865650521] [2020-12-23 16:27:39,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:27:39,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:27:39,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863591244] [2020-12-23 16:27:39,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:27:39,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:27:40,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:27:40,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:27:40,002 INFO L87 Difference]: Start difference. First operand 254 states and 333 transitions. Second operand 3 states. [2020-12-23 16:27:40,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:27:40,088 INFO L93 Difference]: Finished difference Result 587 states and 769 transitions. [2020-12-23 16:27:40,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:27:40,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2020-12-23 16:27:40,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:27:40,096 INFO L225 Difference]: With dead ends: 587 [2020-12-23 16:27:40,097 INFO L226 Difference]: Without dead ends: 505 [2020-12-23 16:27:40,102 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:27:40,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2020-12-23 16:27:40,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 255. [2020-12-23 16:27:40,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2020-12-23 16:27:40,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 334 transitions. [2020-12-23 16:27:40,153 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 334 transitions. Word has length 42 [2020-12-23 16:27:40,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:27:40,153 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 334 transitions. [2020-12-23 16:27:40,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:27:40,154 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 334 transitions. [2020-12-23 16:27:40,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-23 16:27:40,165 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:27:40,168 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:27:40,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-12-23 16:27:40,383 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:27:40,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:27:40,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1837409632, now seen corresponding path program 1 times [2020-12-23 16:27:40,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:27:40,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629006510] [2020-12-23 16:27:40,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:27:40,432 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:27:40,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1524091193] [2020-12-23 16:27:40,438 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:27:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:27:40,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:27:40,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:27:40,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:27:40,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629006510] [2020-12-23 16:27:40,951 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:27:40,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524091193] [2020-12-23 16:27:40,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:27:40,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:27:40,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57144091] [2020-12-23 16:27:40,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:27:40,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:27:40,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:27:40,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:27:40,955 INFO L87 Difference]: Start difference. First operand 255 states and 334 transitions. Second operand 3 states. [2020-12-23 16:27:41,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:27:41,040 INFO L93 Difference]: Finished difference Result 528 states and 696 transitions. [2020-12-23 16:27:41,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:27:41,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2020-12-23 16:27:41,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:27:41,043 INFO L225 Difference]: With dead ends: 528 [2020-12-23 16:27:41,043 INFO L226 Difference]: Without dead ends: 276 [2020-12-23 16:27:41,045 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:27:41,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2020-12-23 16:27:41,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 275. [2020-12-23 16:27:41,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2020-12-23 16:27:41,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 354 transitions. [2020-12-23 16:27:41,057 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 354 transitions. Word has length 140 [2020-12-23 16:27:41,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:27:41,058 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 354 transitions. [2020-12-23 16:27:41,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:27:41,058 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 354 transitions. [2020-12-23 16:27:41,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-23 16:27:41,062 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:27:41,062 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:27:41,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:27:41,276 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:27:41,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:27:41,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1273244828, now seen corresponding path program 1 times [2020-12-23 16:27:41,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:27:41,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417028756] [2020-12-23 16:27:41,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:27:41,314 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:27:41,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [333613496] [2020-12-23 16:27:41,316 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:27:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:27:41,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:27:41,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:27:41,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:27:41,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417028756] [2020-12-23 16:27:41,818 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:27:41,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333613496] [2020-12-23 16:27:41,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:27:41,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:27:41,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530323536] [2020-12-23 16:27:41,819 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:27:41,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:27:41,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:27:41,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:27:41,821 INFO L87 Difference]: Start difference. First operand 275 states and 354 transitions. Second operand 3 states. [2020-12-23 16:27:41,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:27:41,910 INFO L93 Difference]: Finished difference Result 568 states and 736 transitions. [2020-12-23 16:27:41,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:27:41,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2020-12-23 16:27:41,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:27:41,913 INFO L225 Difference]: With dead ends: 568 [2020-12-23 16:27:41,913 INFO L226 Difference]: Without dead ends: 296 [2020-12-23 16:27:41,914 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:27:41,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-12-23 16:27:41,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 295. [2020-12-23 16:27:41,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2020-12-23 16:27:41,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 374 transitions. [2020-12-23 16:27:41,924 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 374 transitions. Word has length 140 [2020-12-23 16:27:41,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:27:41,925 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 374 transitions. [2020-12-23 16:27:41,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:27:41,925 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 374 transitions. [2020-12-23 16:27:41,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-23 16:27:41,928 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:27:41,928 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:27:42,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:27:42,142 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:27:42,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:27:42,144 INFO L82 PathProgramCache]: Analyzing trace with hash -882913824, now seen corresponding path program 1 times [2020-12-23 16:27:42,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:27:42,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615143003] [2020-12-23 16:27:42,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:27:42,174 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:27:42,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [911496830] [2020-12-23 16:27:42,174 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:27:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:27:42,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:27:42,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:27:42,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 16:27:42,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615143003] [2020-12-23 16:27:42,743 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:27:42,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911496830] [2020-12-23 16:27:42,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:27:42,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:27:42,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879477009] [2020-12-23 16:27:42,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:27:42,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:27:42,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:27:42,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:27:42,747 INFO L87 Difference]: Start difference. First operand 295 states and 374 transitions. Second operand 3 states. [2020-12-23 16:27:42,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:27:42,836 INFO L93 Difference]: Finished difference Result 397 states and 510 transitions. [2020-12-23 16:27:42,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:27:42,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2020-12-23 16:27:42,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:27:42,841 INFO L225 Difference]: With dead ends: 397 [2020-12-23 16:27:42,842 INFO L226 Difference]: Without dead ends: 316 [2020-12-23 16:27:42,842 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:27:42,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2020-12-23 16:27:42,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 315. [2020-12-23 16:27:42,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2020-12-23 16:27:42,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 394 transitions. [2020-12-23 16:27:42,851 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 394 transitions. Word has length 140 [2020-12-23 16:27:42,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:27:42,854 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 394 transitions. [2020-12-23 16:27:42,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:27:42,854 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 394 transitions. [2020-12-23 16:27:42,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-23 16:27:42,857 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:27:42,857 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:27:43,070 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:27:43,071 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:27:43,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:27:43,073 INFO L82 PathProgramCache]: Analyzing trace with hash 115522276, now seen corresponding path program 1 times [2020-12-23 16:27:43,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:27:43,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852268897] [2020-12-23 16:27:43,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:27:43,097 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:27:43,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [818816238] [2020-12-23 16:27:43,097 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:27:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:27:43,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:27:43,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:27:43,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:27:43,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852268897] [2020-12-23 16:27:43,563 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:27:43,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818816238] [2020-12-23 16:27:43,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:27:43,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 16:27:43,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216564187] [2020-12-23 16:27:43,565 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:27:43,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:27:43,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:27:43,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:27:43,569 INFO L87 Difference]: Start difference. First operand 315 states and 394 transitions. Second operand 4 states. [2020-12-23 16:27:43,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:27:43,671 INFO L93 Difference]: Finished difference Result 619 states and 777 transitions. [2020-12-23 16:27:43,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:27:43,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2020-12-23 16:27:43,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:27:43,673 INFO L225 Difference]: With dead ends: 619 [2020-12-23 16:27:43,673 INFO L226 Difference]: Without dead ends: 307 [2020-12-23 16:27:43,674 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:27:43,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2020-12-23 16:27:43,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 301. [2020-12-23 16:27:43,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2020-12-23 16:27:43,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 373 transitions. [2020-12-23 16:27:43,684 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 373 transitions. Word has length 140 [2020-12-23 16:27:43,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:27:43,685 INFO L481 AbstractCegarLoop]: Abstraction has 301 states and 373 transitions. [2020-12-23 16:27:43,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:27:43,685 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 373 transitions. [2020-12-23 16:27:43,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-23 16:27:43,687 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:27:43,687 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:27:43,900 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-12-23 16:27:43,901 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:27:43,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:27:43,902 INFO L82 PathProgramCache]: Analyzing trace with hash 32737814, now seen corresponding path program 1 times [2020-12-23 16:27:43,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:27:43,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4654695] [2020-12-23 16:27:43,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:27:43,927 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:27:43,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1006750874] [2020-12-23 16:27:43,928 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:27:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:27:44,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:27:44,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:27:44,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:27:44,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4654695] [2020-12-23 16:27:44,364 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:27:44,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006750874] [2020-12-23 16:27:44,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:27:44,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 16:27:44,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35786099] [2020-12-23 16:27:44,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:27:44,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:27:44,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:27:44,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:27:44,366 INFO L87 Difference]: Start difference. First operand 301 states and 373 transitions. Second operand 4 states. [2020-12-23 16:27:44,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:27:44,460 INFO L93 Difference]: Finished difference Result 680 states and 844 transitions. [2020-12-23 16:27:44,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:27:44,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2020-12-23 16:27:44,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:27:44,464 INFO L225 Difference]: With dead ends: 680 [2020-12-23 16:27:44,464 INFO L226 Difference]: Without dead ends: 382 [2020-12-23 16:27:44,465 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:27:44,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2020-12-23 16:27:44,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 287. [2020-12-23 16:27:44,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2020-12-23 16:27:44,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 352 transitions. [2020-12-23 16:27:44,475 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 352 transitions. Word has length 140 [2020-12-23 16:27:44,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:27:44,477 INFO L481 AbstractCegarLoop]: Abstraction has 287 states and 352 transitions. [2020-12-23 16:27:44,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:27:44,477 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 352 transitions. [2020-12-23 16:27:44,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-23 16:27:44,479 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:27:44,479 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:27:44,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:27:44,694 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:27:44,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:27:44,696 INFO L82 PathProgramCache]: Analyzing trace with hash -577227484, now seen corresponding path program 1 times [2020-12-23 16:27:44,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:27:44,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734644328] [2020-12-23 16:27:44,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:27:44,718 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:27:44,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2135257880] [2020-12-23 16:27:44,718 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:27:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:27:45,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:27:45,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:27:45,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 16:27:45,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734644328] [2020-12-23 16:27:45,219 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:27:45,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135257880] [2020-12-23 16:27:45,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:27:45,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 16:27:45,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354094530] [2020-12-23 16:27:45,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:27:45,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:27:45,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:27:45,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:27:45,222 INFO L87 Difference]: Start difference. First operand 287 states and 352 transitions. Second operand 4 states. [2020-12-23 16:27:45,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:27:45,306 INFO L93 Difference]: Finished difference Result 379 states and 468 transitions. [2020-12-23 16:27:45,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:27:45,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2020-12-23 16:27:45,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:27:45,309 INFO L225 Difference]: With dead ends: 379 [2020-12-23 16:27:45,309 INFO L226 Difference]: Without dead ends: 278 [2020-12-23 16:27:45,310 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:27:45,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-12-23 16:27:45,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 273. [2020-12-23 16:27:45,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2020-12-23 16:27:45,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 331 transitions. [2020-12-23 16:27:45,319 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 331 transitions. Word has length 140 [2020-12-23 16:27:45,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:27:45,319 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 331 transitions. [2020-12-23 16:27:45,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:27:45,319 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 331 transitions. [2020-12-23 16:27:45,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-23 16:27:45,321 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:27:45,321 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:27:45,528 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:27:45,529 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:27:45,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:27:45,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1460076330, now seen corresponding path program 1 times [2020-12-23 16:27:45,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:27:45,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264961012] [2020-12-23 16:27:45,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:27:45,561 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:27:45,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1195456718] [2020-12-23 16:27:45,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:27:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:27:45,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:27:45,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:27:46,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:27:46,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264961012] [2020-12-23 16:27:46,016 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:27:46,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195456718] [2020-12-23 16:27:46,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:27:46,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-12-23 16:27:46,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966258111] [2020-12-23 16:27:46,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:27:46,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:27:46,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:27:46,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:27:46,018 INFO L87 Difference]: Start difference. First operand 273 states and 331 transitions. Second operand 4 states. [2020-12-23 16:27:46,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:27:46,070 INFO L93 Difference]: Finished difference Result 811 states and 984 transitions. [2020-12-23 16:27:46,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:27:46,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2020-12-23 16:27:46,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:27:46,074 INFO L225 Difference]: With dead ends: 811 [2020-12-23 16:27:46,075 INFO L226 Difference]: Without dead ends: 723 [2020-12-23 16:27:46,075 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:27:46,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2020-12-23 16:27:46,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 455. [2020-12-23 16:27:46,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2020-12-23 16:27:46,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 553 transitions. [2020-12-23 16:27:46,093 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 553 transitions. Word has length 140 [2020-12-23 16:27:46,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:27:46,094 INFO L481 AbstractCegarLoop]: Abstraction has 455 states and 553 transitions. [2020-12-23 16:27:46,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:27:46,094 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 553 transitions. [2020-12-23 16:27:46,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2020-12-23 16:27:46,097 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:27:46,097 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:27:46,310 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2020-12-23 16:27:46,311 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:27:46,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:27:46,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1379453485, now seen corresponding path program 2 times [2020-12-23 16:27:46,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:27:46,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550379435] [2020-12-23 16:27:46,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:27:46,337 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:27:46,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [126901583] [2020-12-23 16:27:46,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:27:46,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 16:27:46,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:27:46,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 16:27:46,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:27:47,070 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:27:47,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550379435] [2020-12-23 16:27:47,071 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:27:47,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126901583] [2020-12-23 16:27:47,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:27:47,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-12-23 16:27:47,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000068662] [2020-12-23 16:27:47,072 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 16:27:47,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:27:47,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 16:27:47,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:27:47,073 INFO L87 Difference]: Start difference. First operand 455 states and 553 transitions. Second operand 5 states. [2020-12-23 16:27:47,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:27:47,146 INFO L93 Difference]: Finished difference Result 1080 states and 1310 transitions. [2020-12-23 16:27:47,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 16:27:47,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 238 [2020-12-23 16:27:47,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:27:47,152 INFO L225 Difference]: With dead ends: 1080 [2020-12-23 16:27:47,152 INFO L226 Difference]: Without dead ends: 992 [2020-12-23 16:27:47,153 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:27:47,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2020-12-23 16:27:47,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 637. [2020-12-23 16:27:47,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2020-12-23 16:27:47,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 775 transitions. [2020-12-23 16:27:47,180 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 775 transitions. Word has length 238 [2020-12-23 16:27:47,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:27:47,180 INFO L481 AbstractCegarLoop]: Abstraction has 637 states and 775 transitions. [2020-12-23 16:27:47,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 16:27:47,181 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 775 transitions. [2020-12-23 16:27:47,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2020-12-23 16:27:47,186 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:27:47,186 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:27:47,400 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:27:47,401 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:27:47,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:27:47,402 INFO L82 PathProgramCache]: Analyzing trace with hash 449267140, now seen corresponding path program 3 times [2020-12-23 16:27:47,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:27:47,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874394794] [2020-12-23 16:27:47,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:27:47,432 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:27:47,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [790202741] [2020-12-23 16:27:47,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:27:47,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-23 16:27:47,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:27:47,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 16:27:47,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:27:48,487 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2020-12-23 16:27:48,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874394794] [2020-12-23 16:27:48,488 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:27:48,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790202741] [2020-12-23 16:27:48,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:27:48,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:27:48,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208651860] [2020-12-23 16:27:48,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:27:48,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:27:48,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:27:48,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:27:48,491 INFO L87 Difference]: Start difference. First operand 637 states and 775 transitions. Second operand 3 states. [2020-12-23 16:27:48,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:27:48,567 INFO L93 Difference]: Finished difference Result 1216 states and 1484 transitions. [2020-12-23 16:27:48,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:27:48,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2020-12-23 16:27:48,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:27:48,573 INFO L225 Difference]: With dead ends: 1216 [2020-12-23 16:27:48,573 INFO L226 Difference]: Without dead ends: 635 [2020-12-23 16:27:48,574 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:27:48,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-12-23 16:27:48,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2020-12-23 16:27:48,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2020-12-23 16:27:48,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 772 transitions. [2020-12-23 16:27:48,595 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 772 transitions. Word has length 336 [2020-12-23 16:27:48,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:27:48,595 INFO L481 AbstractCegarLoop]: Abstraction has 635 states and 772 transitions. [2020-12-23 16:27:48,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:27:48,595 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 772 transitions. [2020-12-23 16:27:48,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2020-12-23 16:27:48,601 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:27:48,602 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:27:48,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:27:48,808 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:27:48,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:27:48,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1855273396, now seen corresponding path program 1 times [2020-12-23 16:27:48,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:27:48,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580046171] [2020-12-23 16:27:48,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:27:48,853 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:27:48,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1942250621] [2020-12-23 16:27:48,854 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:27:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:27:49,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 989 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:27:49,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:27:49,679 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2020-12-23 16:27:49,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580046171] [2020-12-23 16:27:49,680 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:27:49,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942250621] [2020-12-23 16:27:49,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:27:49,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:27:49,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945620331] [2020-12-23 16:27:49,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:27:49,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:27:49,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:27:49,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:27:49,682 INFO L87 Difference]: Start difference. First operand 635 states and 772 transitions. Second operand 3 states. [2020-12-23 16:27:49,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:27:49,749 INFO L93 Difference]: Finished difference Result 1232 states and 1512 transitions. [2020-12-23 16:27:49,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:27:49,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 343 [2020-12-23 16:27:49,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:27:49,753 INFO L225 Difference]: With dead ends: 1232 [2020-12-23 16:27:49,754 INFO L226 Difference]: Without dead ends: 647 [2020-12-23 16:27:49,755 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:27:49,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2020-12-23 16:27:49,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2020-12-23 16:27:49,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2020-12-23 16:27:49,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 784 transitions. [2020-12-23 16:27:49,775 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 784 transitions. Word has length 343 [2020-12-23 16:27:49,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:27:49,776 INFO L481 AbstractCegarLoop]: Abstraction has 647 states and 784 transitions. [2020-12-23 16:27:49,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:27:49,776 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 784 transitions. [2020-12-23 16:27:49,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2020-12-23 16:27:49,781 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:27:49,782 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:27:49,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-12-23 16:27:49,998 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:27:49,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:27:49,999 INFO L82 PathProgramCache]: Analyzing trace with hash 162679507, now seen corresponding path program 1 times [2020-12-23 16:27:49,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:27:49,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731350982] [2020-12-23 16:27:49,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:27:50,045 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:27:50,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [255778656] [2020-12-23 16:27:50,046 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:27:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:27:50,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 1001 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 16:27:50,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:27:50,886 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 73 proven. 1 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2020-12-23 16:27:50,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731350982] [2020-12-23 16:27:50,886 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:27:50,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255778656] [2020-12-23 16:27:50,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:27:50,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-12-23 16:27:50,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966913327] [2020-12-23 16:27:50,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:27:50,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:27:50,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:27:50,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:27:50,889 INFO L87 Difference]: Start difference. First operand 647 states and 784 transitions. Second operand 4 states. [2020-12-23 16:27:50,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:27:50,966 INFO L93 Difference]: Finished difference Result 1255 states and 1535 transitions. [2020-12-23 16:27:50,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:27:50,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 345 [2020-12-23 16:27:50,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:27:50,970 INFO L225 Difference]: With dead ends: 1255 [2020-12-23 16:27:50,970 INFO L226 Difference]: Without dead ends: 659 [2020-12-23 16:27:50,972 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:27:50,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2020-12-23 16:27:50,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2020-12-23 16:27:50,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2020-12-23 16:27:50,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 796 transitions. [2020-12-23 16:27:50,994 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 796 transitions. Word has length 345 [2020-12-23 16:27:50,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:27:50,995 INFO L481 AbstractCegarLoop]: Abstraction has 659 states and 796 transitions. [2020-12-23 16:27:50,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:27:50,995 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 796 transitions. [2020-12-23 16:27:50,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2020-12-23 16:27:50,998 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:27:50,998 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:27:51,212 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-12-23 16:27:51,213 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:27:51,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:27:51,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1649703700, now seen corresponding path program 2 times [2020-12-23 16:27:51,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:27:51,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137947768] [2020-12-23 16:27:51,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:27:51,238 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:27:51,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1740060877] [2020-12-23 16:27:51,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:27:51,866 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 16:27:51,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:27:51,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 16:27:51,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:27:52,178 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 73 proven. 3 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2020-12-23 16:27:52,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137947768] [2020-12-23 16:27:52,178 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:27:52,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740060877] [2020-12-23 16:27:52,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:27:52,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-12-23 16:27:52,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626381895] [2020-12-23 16:27:52,180 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 16:27:52,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:27:52,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 16:27:52,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:27:52,181 INFO L87 Difference]: Start difference. First operand 659 states and 796 transitions. Second operand 5 states. [2020-12-23 16:27:52,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:27:52,281 INFO L93 Difference]: Finished difference Result 1278 states and 1558 transitions. [2020-12-23 16:27:52,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 16:27:52,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 347 [2020-12-23 16:27:52,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:27:52,285 INFO L225 Difference]: With dead ends: 1278 [2020-12-23 16:27:52,285 INFO L226 Difference]: Without dead ends: 671 [2020-12-23 16:27:52,287 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:27:52,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2020-12-23 16:27:52,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2020-12-23 16:27:52,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2020-12-23 16:27:52,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 808 transitions. [2020-12-23 16:27:52,315 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 808 transitions. Word has length 347 [2020-12-23 16:27:52,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:27:52,315 INFO L481 AbstractCegarLoop]: Abstraction has 671 states and 808 transitions. [2020-12-23 16:27:52,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 16:27:52,316 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 808 transitions. [2020-12-23 16:27:52,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2020-12-23 16:27:52,319 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:27:52,319 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:27:52,533 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-12-23 16:27:52,534 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:27:52,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:27:52,534 INFO L82 PathProgramCache]: Analyzing trace with hash 457445491, now seen corresponding path program 3 times [2020-12-23 16:27:52,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:27:52,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629590647] [2020-12-23 16:27:52,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:27:52,565 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:27:52,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [183080230] [2020-12-23 16:27:52,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:27:53,026 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-23 16:27:53,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:27:53,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 16:27:53,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:27:53,556 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2020-12-23 16:27:53,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629590647] [2020-12-23 16:27:53,556 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:27:53,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183080230] [2020-12-23 16:27:53,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:27:53,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:27:53,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532754528] [2020-12-23 16:27:53,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:27:53,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:27:53,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:27:53,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:27:53,558 INFO L87 Difference]: Start difference. First operand 671 states and 808 transitions. Second operand 3 states. [2020-12-23 16:27:53,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:27:53,626 INFO L93 Difference]: Finished difference Result 1256 states and 1514 transitions. [2020-12-23 16:27:53,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:27:53,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 349 [2020-12-23 16:27:53,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:27:53,631 INFO L225 Difference]: With dead ends: 1256 [2020-12-23 16:27:53,631 INFO L226 Difference]: Without dead ends: 740 [2020-12-23 16:27:53,632 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:27:53,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2020-12-23 16:27:53,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 728. [2020-12-23 16:27:53,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2020-12-23 16:27:53,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 880 transitions. [2020-12-23 16:27:53,658 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 880 transitions. Word has length 349 [2020-12-23 16:27:53,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:27:53,658 INFO L481 AbstractCegarLoop]: Abstraction has 728 states and 880 transitions. [2020-12-23 16:27:53,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:27:53,658 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 880 transitions. [2020-12-23 16:27:53,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2020-12-23 16:27:53,661 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:27:53,661 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:27:53,874 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:27:53,875 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:27:53,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:27:53,876 INFO L82 PathProgramCache]: Analyzing trace with hash -2060178602, now seen corresponding path program 1 times [2020-12-23 16:27:53,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:27:53,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720368495] [2020-12-23 16:27:53,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:27:53,898 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:27:53,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1820686007] [2020-12-23 16:27:53,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:27:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:27:54,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 1149 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-23 16:27:54,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:27:54,898 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 73 proven. 6 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-12-23 16:27:54,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720368495] [2020-12-23 16:27:54,899 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:27:54,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820686007] [2020-12-23 16:27:54,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:27:54,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-12-23 16:27:54,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244808825] [2020-12-23 16:27:54,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 16:27:54,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:27:54,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 16:27:54,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 16:27:54,901 INFO L87 Difference]: Start difference. First operand 728 states and 880 transitions. Second operand 6 states. [2020-12-23 16:27:55,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:27:55,008 INFO L93 Difference]: Finished difference Result 1415 states and 1725 transitions. [2020-12-23 16:27:55,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 16:27:55,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 362 [2020-12-23 16:27:55,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:27:55,012 INFO L225 Difference]: With dead ends: 1415 [2020-12-23 16:27:55,013 INFO L226 Difference]: Without dead ends: 740 [2020-12-23 16:27:55,014 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 16:27:55,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2020-12-23 16:27:55,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2020-12-23 16:27:55,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2020-12-23 16:27:55,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 892 transitions. [2020-12-23 16:27:55,043 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 892 transitions. Word has length 362 [2020-12-23 16:27:55,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:27:55,043 INFO L481 AbstractCegarLoop]: Abstraction has 740 states and 892 transitions. [2020-12-23 16:27:55,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 16:27:55,043 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 892 transitions. [2020-12-23 16:27:55,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2020-12-23 16:27:55,047 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:27:55,047 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:27:55,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-12-23 16:27:55,261 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:27:55,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:27:55,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1507573012, now seen corresponding path program 2 times [2020-12-23 16:27:55,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:27:55,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690664023] [2020-12-23 16:27:55,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:27:55,284 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:27:55,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [326424215] [2020-12-23 16:27:55,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:27:55,899 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 16:27:55,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:27:55,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 1173 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-23 16:27:55,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:27:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 73 proven. 10 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2020-12-23 16:27:56,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690664023] [2020-12-23 16:27:56,300 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:27:56,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326424215] [2020-12-23 16:27:56,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:27:56,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-12-23 16:27:56,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366337709] [2020-12-23 16:27:56,304 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 16:27:56,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:27:56,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 16:27:56,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-23 16:27:56,305 INFO L87 Difference]: Start difference. First operand 740 states and 892 transitions. Second operand 7 states. [2020-12-23 16:27:56,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:27:56,448 INFO L93 Difference]: Finished difference Result 1438 states and 1748 transitions. [2020-12-23 16:27:56,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 16:27:56,448 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 366 [2020-12-23 16:27:56,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:27:56,452 INFO L225 Difference]: With dead ends: 1438 [2020-12-23 16:27:56,452 INFO L226 Difference]: Without dead ends: 752 [2020-12-23 16:27:56,453 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-23 16:27:56,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2020-12-23 16:27:56,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 752. [2020-12-23 16:27:56,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2020-12-23 16:27:56,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 904 transitions. [2020-12-23 16:27:56,479 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 904 transitions. Word has length 366 [2020-12-23 16:27:56,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:27:56,479 INFO L481 AbstractCegarLoop]: Abstraction has 752 states and 904 transitions. [2020-12-23 16:27:56,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 16:27:56,479 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 904 transitions. [2020-12-23 16:27:56,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2020-12-23 16:27:56,482 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:27:56,482 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:27:56,696 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-12-23 16:27:56,697 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:27:56,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:27:56,698 INFO L82 PathProgramCache]: Analyzing trace with hash 823733142, now seen corresponding path program 3 times [2020-12-23 16:27:56,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:27:56,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586832457] [2020-12-23 16:27:56,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:27:56,741 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:27:56,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [409220613] [2020-12-23 16:27:56,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:27:57,169 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-23 16:27:57,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:27:57,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 16:27:57,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:27:57,648 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2020-12-23 16:27:57,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586832457] [2020-12-23 16:27:57,648 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:27:57,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409220613] [2020-12-23 16:27:57,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:27:57,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:27:57,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810930168] [2020-12-23 16:27:57,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:27:57,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:27:57,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:27:57,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:27:57,651 INFO L87 Difference]: Start difference. First operand 752 states and 904 transitions. Second operand 3 states. [2020-12-23 16:27:57,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:27:57,747 INFO L93 Difference]: Finished difference Result 1376 states and 1653 transitions. [2020-12-23 16:27:57,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:27:57,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 370 [2020-12-23 16:27:57,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:27:57,754 INFO L225 Difference]: With dead ends: 1376 [2020-12-23 16:27:57,754 INFO L226 Difference]: Without dead ends: 1027 [2020-12-23 16:27:57,755 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:27:57,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2020-12-23 16:27:57,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 1015. [2020-12-23 16:27:57,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2020-12-23 16:27:57,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1222 transitions. [2020-12-23 16:27:57,789 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1222 transitions. Word has length 370 [2020-12-23 16:27:57,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:27:57,790 INFO L481 AbstractCegarLoop]: Abstraction has 1015 states and 1222 transitions. [2020-12-23 16:27:57,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:27:57,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1222 transitions. [2020-12-23 16:27:57,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2020-12-23 16:27:57,793 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:27:57,794 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:27:57,999 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-23 16:27:58,000 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:27:58,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:27:58,001 INFO L82 PathProgramCache]: Analyzing trace with hash -145231630, now seen corresponding path program 1 times [2020-12-23 16:27:58,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:27:58,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909155260] [2020-12-23 16:27:58,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:27:58,029 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:27:58,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2008417747] [2020-12-23 16:27:58,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:27:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:27:58,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 1223 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-23 16:27:58,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:27:59,028 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 73 proven. 15 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2020-12-23 16:27:59,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909155260] [2020-12-23 16:27:59,029 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:27:59,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008417747] [2020-12-23 16:27:59,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:27:59,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-12-23 16:27:59,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213952150] [2020-12-23 16:27:59,031 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 16:27:59,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:27:59,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 16:27:59,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-12-23 16:27:59,033 INFO L87 Difference]: Start difference. First operand 1015 states and 1222 transitions. Second operand 8 states. [2020-12-23 16:27:59,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:27:59,167 INFO L93 Difference]: Finished difference Result 1989 states and 2411 transitions. [2020-12-23 16:27:59,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 16:27:59,168 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 377 [2020-12-23 16:27:59,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:27:59,173 INFO L225 Difference]: With dead ends: 1989 [2020-12-23 16:27:59,173 INFO L226 Difference]: Without dead ends: 1029 [2020-12-23 16:27:59,177 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-12-23 16:27:59,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2020-12-23 16:27:59,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1029. [2020-12-23 16:27:59,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2020-12-23 16:27:59,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1236 transitions. [2020-12-23 16:27:59,213 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1236 transitions. Word has length 377 [2020-12-23 16:27:59,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:27:59,214 INFO L481 AbstractCegarLoop]: Abstraction has 1029 states and 1236 transitions. [2020-12-23 16:27:59,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 16:27:59,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1236 transitions. [2020-12-23 16:27:59,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2020-12-23 16:27:59,217 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:27:59,218 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:27:59,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:27:59,432 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:27:59,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:27:59,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1700907916, now seen corresponding path program 2 times [2020-12-23 16:27:59,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:27:59,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636470184] [2020-12-23 16:27:59,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:27:59,462 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:27:59,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1454359495] [2020-12-23 16:27:59,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:28:00,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 16:28:00,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:28:00,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 1247 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-23 16:28:00,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:28:00,582 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 73 proven. 21 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2020-12-23 16:28:00,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636470184] [2020-12-23 16:28:00,583 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:28:00,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454359495] [2020-12-23 16:28:00,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:28:00,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-12-23 16:28:00,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049078861] [2020-12-23 16:28:00,583 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 16:28:00,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:28:00,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 16:28:00,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-12-23 16:28:00,584 INFO L87 Difference]: Start difference. First operand 1029 states and 1236 transitions. Second operand 9 states. [2020-12-23 16:28:00,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:28:00,715 INFO L93 Difference]: Finished difference Result 2016 states and 2438 transitions. [2020-12-23 16:28:00,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 16:28:00,716 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 381 [2020-12-23 16:28:00,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:28:00,721 INFO L225 Difference]: With dead ends: 2016 [2020-12-23 16:28:00,721 INFO L226 Difference]: Without dead ends: 1043 [2020-12-23 16:28:00,723 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-12-23 16:28:00,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2020-12-23 16:28:00,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1043. [2020-12-23 16:28:00,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2020-12-23 16:28:00,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1250 transitions. [2020-12-23 16:28:00,762 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1250 transitions. Word has length 381 [2020-12-23 16:28:00,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:28:00,763 INFO L481 AbstractCegarLoop]: Abstraction has 1043 states and 1250 transitions. [2020-12-23 16:28:00,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 16:28:00,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1250 transitions. [2020-12-23 16:28:00,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2020-12-23 16:28:00,767 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:28:00,767 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:28:00,976 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:28:00,977 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:28:00,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:28:00,978 INFO L82 PathProgramCache]: Analyzing trace with hash -336611150, now seen corresponding path program 3 times [2020-12-23 16:28:00,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:28:00,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478004439] [2020-12-23 16:28:00,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:28:01,006 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:28:01,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [35555511] [2020-12-23 16:28:01,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 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