/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_test6-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 04:40:19,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 04:40:19,567 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 04:40:19,603 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 04:40:19,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 04:40:19,606 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 04:40:19,608 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 04:40:19,610 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 04:40:19,613 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 04:40:19,614 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 04:40:19,615 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 04:40:19,617 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 04:40:19,617 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 04:40:19,619 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 04:40:19,620 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 04:40:19,622 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 04:40:19,623 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 04:40:19,625 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 04:40:19,627 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 04:40:19,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 04:40:19,636 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 04:40:19,639 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 04:40:19,641 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 04:40:19,643 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 04:40:19,648 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 04:40:19,651 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 04:40:19,651 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 04:40:19,657 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 04:40:19,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 04:40:19,662 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 04:40:19,662 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 04:40:19,663 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 04:40:19,665 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 04:40:19,667 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 04:40:19,668 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 04:40:19,680 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 04:40:19,685 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 04:40:19,686 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 04:40:19,690 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 04:40:19,695 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 04:40:19,697 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 04:40:19,698 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-07 04:40:19,753 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 04:40:19,754 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 04:40:19,758 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 04:40:19,758 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 04:40:19,759 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 04:40:19,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 04:40:19,760 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 04:40:19,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 04:40:19,761 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 04:40:19,761 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 04:40:19,762 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 04:40:19,762 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 04:40:19,762 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 04:40:19,763 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 04:40:19,763 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 04:40:19,763 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 04:40:19,763 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 04:40:19,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 04:40:19,764 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 04:40:19,764 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 04:40:19,764 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 04:40:19,764 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 04:40:19,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 04:40:19,765 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 04:40:19,765 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 04:40:19,765 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 [2021-01-07 04:40:20,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 04:40:20,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 04:40:20,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 04:40:20,255 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 04:40:20,256 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 04:40:20,257 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_test6-2.i [2021-01-07 04:40:20,339 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/63e25f46f/b197d023c5e24042a4e861cd8bc9fdd7/FLAGf2f0cd21e [2021-01-07 04:40:21,112 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 04:40:21,113 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i [2021-01-07 04:40:21,152 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/63e25f46f/b197d023c5e24042a4e861cd8bc9fdd7/FLAGf2f0cd21e [2021-01-07 04:40:21,270 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/63e25f46f/b197d023c5e24042a4e861cd8bc9fdd7 [2021-01-07 04:40:21,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 04:40:21,278 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 04:40:21,281 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 04:40:21,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 04:40:21,286 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 04:40:21,288 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 04:40:21" (1/1) ... [2021-01-07 04:40:21,290 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33b4ec59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:40:21, skipping insertion in model container [2021-01-07 04:40:21,291 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 04:40:21" (1/1) ... [2021-01-07 04:40:21,305 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 04:40:21,410 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-07 04:40:22,064 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_test6-2.i[44118,44131] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~alt_malloc_sizes~0,GLOBAL],[IdentifierExpression[#t~post33,]]] [2021-01-07 04:40:22,081 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_test6-2.i[44660,44673] 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~mem70,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem70,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem71,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem71,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem72,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem72,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem73,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem73,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem74,],base],StructAccessExpression[IdentifierExpression[#t~mem74,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem76,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem76,],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~mem88,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem88,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem89,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem89,],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~mem101,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem101,],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~mem112,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem112,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem122,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem122,],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~mem148,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem148,],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~mem158,],base],StructAccessExpression[IdentifierExpression[#t~mem158,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem159,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem159,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem169,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~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: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem224,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem224,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem229,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem229,],offset],IdentifierExpression[#t~mem231,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem235,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem235,],offset],IdentifierExpression[#t~mem237,]]]]] 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~mem249,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem249,],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]]]] [2021-01-07 04:40:22,258 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_test6-2.i[56247,56260] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] [2021-01-07 04:40:22,260 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_test6-2.i[56368,56381] 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~mem272,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem272,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem277,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem277,],offset],IdentifierExpression[#t~mem279,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem283,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem283,],offset],IdentifierExpression[#t~mem285,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~1,],base],StructAccessExpression[IdentifierExpression[~_hd_head~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem297,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem297,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem300,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem300,],offset]]]] [2021-01-07 04:40:22,283 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 04:40:22,294 INFO L203 MainTranslator]: Completed pre-run [2021-01-07 04:40:22,342 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_test6-2.i[44118,44131] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#alt_malloc_sizes~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#alt_malloc_sizes~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[#t~post33,]]]]] [2021-01-07 04:40:22,346 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_test6-2.i[44660,44673] left hand side expression in assignment: address: IdentifierExpression[~#i~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],StructAccessExpression[IdentifierExpression[~user~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem76,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem76,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem77,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem77,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem78,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem78,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem79,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem79,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem80,],base],StructAccessExpression[IdentifierExpression[#t~mem80,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem82,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem82,],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~mem94,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem94,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem95,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem95,],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~mem107,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem107,],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~mem120,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem120,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem130,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem130,],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~mem157,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem157,],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~mem167,],base],StructAccessExpression[IdentifierExpression[#t~mem167,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem169,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem179,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem179,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~#i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~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: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem236,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem236,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem241,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem241,],offset],IdentifierExpression[#t~mem243,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem247,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem247,],offset],IdentifierExpression[#t~mem249,]]]]] 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~mem261,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem261,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem264,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem264,],offset]]]] [2021-01-07 04:40:22,433 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_test6-2.i[56247,56260] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] [2021-01-07 04:40:22,434 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_test6-2.i[56368,56381] 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~mem284,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem284,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem289,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem289,],offset],IdentifierExpression[#t~mem291,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem295,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem295,],offset],IdentifierExpression[#t~mem297,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~1,],base],StructAccessExpression[IdentifierExpression[~_hd_head~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem309,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem309,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem312,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem312,],offset]]]] [2021-01-07 04:40:22,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 04:40:22,724 INFO L208 MainTranslator]: Completed translation [2021-01-07 04:40:22,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:40:22 WrapperNode [2021-01-07 04:40:22,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 04:40:22,727 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 04:40:22,728 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 04:40:22,728 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 04:40:22,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:40:22" (1/1) ... [2021-01-07 04:40:22,828 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:40:22" (1/1) ... [2021-01-07 04:40:23,002 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 04:40:23,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 04:40:23,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 04:40:23,007 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 04:40:23,044 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:40:22" (1/1) ... [2021-01-07 04:40:23,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:40:22" (1/1) ... [2021-01-07 04:40:23,069 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:40:22" (1/1) ... [2021-01-07 04:40:23,069 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:40:22" (1/1) ... [2021-01-07 04:40:23,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:40:22" (1/1) ... [2021-01-07 04:40:23,154 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:40:22" (1/1) ... [2021-01-07 04:40:23,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:40:22" (1/1) ... [2021-01-07 04:40:23,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 04:40:23,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 04:40:23,180 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 04:40:23,180 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 04:40:23,181 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:40:22" (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 [2021-01-07 04:40:23,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 04:40:23,303 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-01-07 04:40:23,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 04:40:23,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 04:40:23,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 04:40:23,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 04:40:23,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 04:40:23,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 04:40:23,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 04:40:23,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 04:40:23,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 04:40:25,488 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 04:40:25,488 INFO L299 CfgBuilder]: Removed 124 assume(true) statements. [2021-01-07 04:40:25,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 04:40:25 BoogieIcfgContainer [2021-01-07 04:40:25,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 04:40:25,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 04:40:25,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 04:40:25,497 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 04:40:25,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 04:40:21" (1/3) ... [2021-01-07 04:40:25,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66bfc359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 04:40:25, skipping insertion in model container [2021-01-07 04:40:25,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:40:22" (2/3) ... [2021-01-07 04:40:25,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66bfc359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 04:40:25, skipping insertion in model container [2021-01-07 04:40:25,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 04:40:25" (3/3) ... [2021-01-07 04:40:25,500 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test6-2.i [2021-01-07 04:40:25,508 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 04:40:25,514 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2021-01-07 04:40:25,565 INFO L253 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2021-01-07 04:40:25,595 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 04:40:25,596 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 04:40:25,596 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 04:40:25,596 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 04:40:25,596 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 04:40:25,596 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 04:40:25,596 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 04:40:25,597 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 04:40:25,622 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states. [2021-01-07 04:40:25,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-01-07 04:40:25,628 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:40:25,629 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:40:25,629 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:40:25,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:40:25,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1030621672, now seen corresponding path program 1 times [2021-01-07 04:40:25,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:40:25,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352716064] [2021-01-07 04:40:25,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:40:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:40:25,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:40:25,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352716064] [2021-01-07 04:40:25,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:40:25,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 04:40:25,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268114416] [2021-01-07 04:40:25,850 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-07 04:40:25,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:40:25,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-07 04:40:25,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 04:40:25,869 INFO L87 Difference]: Start difference. First operand 276 states. Second operand 2 states. [2021-01-07 04:40:25,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:40:25,938 INFO L93 Difference]: Finished difference Result 544 states and 861 transitions. [2021-01-07 04:40:25,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-07 04:40:25,939 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2021-01-07 04:40:25,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:40:25,965 INFO L225 Difference]: With dead ends: 544 [2021-01-07 04:40:25,966 INFO L226 Difference]: Without dead ends: 266 [2021-01-07 04:40:25,978 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 [2021-01-07 04:40:26,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-01-07 04:40:26,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2021-01-07 04:40:26,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2021-01-07 04:40:26,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 335 transitions. [2021-01-07 04:40:26,077 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 335 transitions. Word has length 8 [2021-01-07 04:40:26,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:40:26,078 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 335 transitions. [2021-01-07 04:40:26,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-07 04:40:26,078 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 335 transitions. [2021-01-07 04:40:26,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-07 04:40:26,079 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:40:26,080 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:40:26,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 04:40:26,080 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:40:26,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:40:26,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1260005844, now seen corresponding path program 1 times [2021-01-07 04:40:26,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:40:26,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547078712] [2021-01-07 04:40:26,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:40:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:40:26,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:40:26,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547078712] [2021-01-07 04:40:26,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:40:26,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:40:26,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618004686] [2021-01-07 04:40:26,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:40:26,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:40:26,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:40:26,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:40:26,230 INFO L87 Difference]: Start difference. First operand 266 states and 335 transitions. Second operand 4 states. [2021-01-07 04:40:26,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:40:26,877 INFO L93 Difference]: Finished difference Result 589 states and 741 transitions. [2021-01-07 04:40:26,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:40:26,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2021-01-07 04:40:26,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:40:26,882 INFO L225 Difference]: With dead ends: 589 [2021-01-07 04:40:26,882 INFO L226 Difference]: Without dead ends: 440 [2021-01-07 04:40:26,883 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:40:26,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-01-07 04:40:26,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 268. [2021-01-07 04:40:26,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2021-01-07 04:40:26,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 337 transitions. [2021-01-07 04:40:26,899 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 337 transitions. Word has length 10 [2021-01-07 04:40:26,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:40:26,900 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 337 transitions. [2021-01-07 04:40:26,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:40:26,900 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 337 transitions. [2021-01-07 04:40:26,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 04:40:26,901 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:40:26,902 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] [2021-01-07 04:40:26,902 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 04:40:26,902 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:40:26,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:40:26,903 INFO L82 PathProgramCache]: Analyzing trace with hash -602340381, now seen corresponding path program 1 times [2021-01-07 04:40:26,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:40:26,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777398899] [2021-01-07 04:40:26,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:40:26,950 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:40:26,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1048351864] [2021-01-07 04:40:26,950 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 [2021-01-07 04:40:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:40:27,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:40:27,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:40:27,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:40:27,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777398899] [2021-01-07 04:40:27,423 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:40:27,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048351864] [2021-01-07 04:40:27,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:40:27,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:40:27,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737728253] [2021-01-07 04:40:27,424 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:40:27,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:40:27,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:40:27,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:40:27,426 INFO L87 Difference]: Start difference. First operand 268 states and 337 transitions. Second operand 3 states. [2021-01-07 04:40:27,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:40:27,571 INFO L93 Difference]: Finished difference Result 553 states and 701 transitions. [2021-01-07 04:40:27,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:40:27,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2021-01-07 04:40:27,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:40:27,575 INFO L225 Difference]: With dead ends: 553 [2021-01-07 04:40:27,575 INFO L226 Difference]: Without dead ends: 289 [2021-01-07 04:40:27,578 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:40:27,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-01-07 04:40:27,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 288. [2021-01-07 04:40:27,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2021-01-07 04:40:27,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 357 transitions. [2021-01-07 04:40:27,597 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 357 transitions. Word has length 44 [2021-01-07 04:40:27,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:40:27,598 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 357 transitions. [2021-01-07 04:40:27,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:40:27,598 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 357 transitions. [2021-01-07 04:40:27,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 04:40:27,602 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:40:27,602 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] [2021-01-07 04:40:27,818 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-01-07 04:40:27,819 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:40:27,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:40:27,822 INFO L82 PathProgramCache]: Analyzing trace with hash -821195099, now seen corresponding path program 1 times [2021-01-07 04:40:27,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:40:27,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483444892] [2021-01-07 04:40:27,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:40:27,858 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:40:27,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [934804657] [2021-01-07 04:40:27,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2021-01-07 04:40:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:40:28,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:40:28,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:40:28,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:40:28,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483444892] [2021-01-07 04:40:28,205 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:40:28,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934804657] [2021-01-07 04:40:28,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:40:28,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:40:28,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437847241] [2021-01-07 04:40:28,206 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:40:28,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:40:28,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:40:28,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:40:28,209 INFO L87 Difference]: Start difference. First operand 288 states and 357 transitions. Second operand 4 states. [2021-01-07 04:40:28,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:40:28,315 INFO L93 Difference]: Finished difference Result 565 states and 703 transitions. [2021-01-07 04:40:28,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:40:28,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2021-01-07 04:40:28,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:40:28,318 INFO L225 Difference]: With dead ends: 565 [2021-01-07 04:40:28,318 INFO L226 Difference]: Without dead ends: 281 [2021-01-07 04:40:28,319 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:40:28,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-01-07 04:40:28,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 274. [2021-01-07 04:40:28,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2021-01-07 04:40:28,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 336 transitions. [2021-01-07 04:40:28,339 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 336 transitions. Word has length 44 [2021-01-07 04:40:28,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:40:28,340 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 336 transitions. [2021-01-07 04:40:28,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:40:28,340 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 336 transitions. [2021-01-07 04:40:28,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 04:40:28,344 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:40:28,344 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] [2021-01-07 04:40:28,557 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:40:28,558 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:40:28,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:40:28,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1704043945, now seen corresponding path program 1 times [2021-01-07 04:40:28,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:40:28,560 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020526360] [2021-01-07 04:40:28,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:40:28,581 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:40:28,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [380949543] [2021-01-07 04:40:28,582 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 [2021-01-07 04:40:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:40:28,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 19 conjunts are in the unsatisfiable core [2021-01-07 04:40:28,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:40:28,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:40:28,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020526360] [2021-01-07 04:40:28,967 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:40:28,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380949543] [2021-01-07 04:40:28,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:40:28,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 04:40:28,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807728041] [2021-01-07 04:40:28,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 04:40:28,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:40:28,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 04:40:28,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 04:40:28,969 INFO L87 Difference]: Start difference. First operand 274 states and 336 transitions. Second operand 6 states. [2021-01-07 04:40:29,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:40:29,809 INFO L93 Difference]: Finished difference Result 486 states and 600 transitions. [2021-01-07 04:40:29,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 04:40:29,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2021-01-07 04:40:29,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:40:29,814 INFO L225 Difference]: With dead ends: 486 [2021-01-07 04:40:29,814 INFO L226 Difference]: Without dead ends: 484 [2021-01-07 04:40:29,815 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-01-07 04:40:29,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2021-01-07 04:40:29,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 272. [2021-01-07 04:40:29,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2021-01-07 04:40:29,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 334 transitions. [2021-01-07 04:40:29,828 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 334 transitions. Word has length 44 [2021-01-07 04:40:29,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:40:29,829 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 334 transitions. [2021-01-07 04:40:29,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 04:40:29,829 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 334 transitions. [2021-01-07 04:40:29,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-07 04:40:29,841 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:40:29,841 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] [2021-01-07 04:40:30,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:40:30,057 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:40:30,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:40:30,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1088553020, now seen corresponding path program 1 times [2021-01-07 04:40:30,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:40:30,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252484246] [2021-01-07 04:40:30,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:40:30,081 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:40:30,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1272076187] [2021-01-07 04:40:30,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2021-01-07 04:40:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:40:30,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 04:40:30,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:40:30,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:40:30,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252484246] [2021-01-07 04:40:30,485 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:40:30,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272076187] [2021-01-07 04:40:30,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:40:30,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:40:30,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427268263] [2021-01-07 04:40:30,487 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 04:40:30,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:40:30,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 04:40:30,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:40:30,488 INFO L87 Difference]: Start difference. First operand 272 states and 334 transitions. Second operand 5 states. [2021-01-07 04:40:30,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:40:30,671 INFO L93 Difference]: Finished difference Result 1120 states and 1390 transitions. [2021-01-07 04:40:30,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 04:40:30,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2021-01-07 04:40:30,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:40:30,677 INFO L225 Difference]: With dead ends: 1120 [2021-01-07 04:40:30,678 INFO L226 Difference]: Without dead ends: 852 [2021-01-07 04:40:30,679 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:40:30,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2021-01-07 04:40:30,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 364. [2021-01-07 04:40:30,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2021-01-07 04:40:30,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 445 transitions. [2021-01-07 04:40:30,703 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 445 transitions. Word has length 51 [2021-01-07 04:40:30,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:40:30,704 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 445 transitions. [2021-01-07 04:40:30,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 04:40:30,704 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 445 transitions. [2021-01-07 04:40:30,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-07 04:40:30,705 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:40:30,705 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] [2021-01-07 04:40:30,917 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:40:30,918 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:40:30,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:40:30,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1193587178, now seen corresponding path program 1 times [2021-01-07 04:40:30,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:40:30,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867058174] [2021-01-07 04:40:30,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:40:30,963 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:40:30,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1897856728] [2021-01-07 04:40:30,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2021-01-07 04:40:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:40:31,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 04:40:31,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:40:31,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:40:31,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867058174] [2021-01-07 04:40:31,309 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:40:31,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897856728] [2021-01-07 04:40:31,309 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:40:31,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:40:31,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622371687] [2021-01-07 04:40:31,310 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:40:31,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:40:31,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:40:31,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:40:31,311 INFO L87 Difference]: Start difference. First operand 364 states and 445 transitions. Second operand 3 states. [2021-01-07 04:40:31,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:40:31,521 INFO L93 Difference]: Finished difference Result 802 states and 981 transitions. [2021-01-07 04:40:31,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:40:31,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2021-01-07 04:40:31,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:40:31,524 INFO L225 Difference]: With dead ends: 802 [2021-01-07 04:40:31,525 INFO L226 Difference]: Without dead ends: 442 [2021-01-07 04:40:31,526 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:40:31,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2021-01-07 04:40:31,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 385. [2021-01-07 04:40:31,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2021-01-07 04:40:31,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 476 transitions. [2021-01-07 04:40:31,544 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 476 transitions. Word has length 54 [2021-01-07 04:40:31,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:40:31,546 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 476 transitions. [2021-01-07 04:40:31,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:40:31,546 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 476 transitions. [2021-01-07 04:40:31,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-07 04:40:31,548 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:40:31,549 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:40:31,762 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-01-07 04:40:31,763 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:40:31,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:40:31,764 INFO L82 PathProgramCache]: Analyzing trace with hash 901612414, now seen corresponding path program 1 times [2021-01-07 04:40:31,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:40:31,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247847909] [2021-01-07 04:40:31,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:40:31,788 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:40:31,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [507694184] [2021-01-07 04:40:31,788 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 [2021-01-07 04:40:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:40:32,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 04:40:32,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:40:32,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:40:32,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247847909] [2021-01-07 04:40:32,146 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:40:32,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507694184] [2021-01-07 04:40:32,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:40:32,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:40:32,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300905196] [2021-01-07 04:40:32,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:40:32,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:40:32,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:40:32,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:40:32,148 INFO L87 Difference]: Start difference. First operand 385 states and 476 transitions. Second operand 4 states. [2021-01-07 04:40:32,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:40:32,281 INFO L93 Difference]: Finished difference Result 724 states and 901 transitions. [2021-01-07 04:40:32,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:40:32,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2021-01-07 04:40:32,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:40:32,285 INFO L225 Difference]: With dead ends: 724 [2021-01-07 04:40:32,285 INFO L226 Difference]: Without dead ends: 391 [2021-01-07 04:40:32,286 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:40:32,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2021-01-07 04:40:32,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 385. [2021-01-07 04:40:32,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2021-01-07 04:40:32,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 475 transitions. [2021-01-07 04:40:32,303 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 475 transitions. Word has length 78 [2021-01-07 04:40:32,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:40:32,303 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 475 transitions. [2021-01-07 04:40:32,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:40:32,304 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 475 transitions. [2021-01-07 04:40:32,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-01-07 04:40:32,304 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:40:32,305 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:40:32,518 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:40:32,519 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:40:32,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:40:32,520 INFO L82 PathProgramCache]: Analyzing trace with hash -611683268, now seen corresponding path program 1 times [2021-01-07 04:40:32,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:40:32,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298679310] [2021-01-07 04:40:32,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:40:32,541 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:40:32,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1489396131] [2021-01-07 04:40:32,542 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 [2021-01-07 04:40:32,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:40:32,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:40:32,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:40:32,924 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 04:40:32,928 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:40:32,932 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:40:32,932 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:40:32,933 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2021-01-07 04:40:32,950 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-01-07 04:40:32,951 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:40:32,953 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:40:32,954 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:40:32,954 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2021-01-07 04:40:32,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 04:40:32,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298679310] [2021-01-07 04:40:32,966 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:40:32,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489396131] [2021-01-07 04:40:32,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:40:32,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:40:32,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544594562] [2021-01-07 04:40:32,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:40:32,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:40:32,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:40:32,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:40:32,968 INFO L87 Difference]: Start difference. First operand 385 states and 475 transitions. Second operand 4 states. [2021-01-07 04:40:33,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:40:33,420 INFO L93 Difference]: Finished difference Result 535 states and 665 transitions. [2021-01-07 04:40:33,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:40:33,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2021-01-07 04:40:33,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:40:33,424 INFO L225 Difference]: With dead ends: 535 [2021-01-07 04:40:33,424 INFO L226 Difference]: Without dead ends: 480 [2021-01-07 04:40:33,425 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:40:33,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2021-01-07 04:40:33,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 387. [2021-01-07 04:40:33,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2021-01-07 04:40:33,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 477 transitions. [2021-01-07 04:40:33,443 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 477 transitions. Word has length 79 [2021-01-07 04:40:33,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:40:33,445 INFO L481 AbstractCegarLoop]: Abstraction has 387 states and 477 transitions. [2021-01-07 04:40:33,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:40:33,445 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 477 transitions. [2021-01-07 04:40:33,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-01-07 04:40:33,446 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:40:33,446 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] [2021-01-07 04:40:33,660 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:40:33,661 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:40:33,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:40:33,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1201768388, now seen corresponding path program 1 times [2021-01-07 04:40:33,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:40:33,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617483963] [2021-01-07 04:40:33,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:40:33,694 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:40:33,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1314570225] [2021-01-07 04:40:33,695 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 [2021-01-07 04:40:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:40:34,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 16 conjunts are in the unsatisfiable core [2021-01-07 04:40:34,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:40:34,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:40:34,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617483963] [2021-01-07 04:40:34,133 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:40:34,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314570225] [2021-01-07 04:40:34,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:40:34,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 04:40:34,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199384251] [2021-01-07 04:40:34,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 04:40:34,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:40:34,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 04:40:34,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:40:34,137 INFO L87 Difference]: Start difference. First operand 387 states and 477 transitions. Second operand 5 states. [2021-01-07 04:40:34,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:40:34,288 INFO L93 Difference]: Finished difference Result 724 states and 901 transitions. [2021-01-07 04:40:34,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 04:40:34,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2021-01-07 04:40:34,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:40:34,291 INFO L225 Difference]: With dead ends: 724 [2021-01-07 04:40:34,291 INFO L226 Difference]: Without dead ends: 389 [2021-01-07 04:40:34,292 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 04:40:34,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-01-07 04:40:34,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2021-01-07 04:40:34,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2021-01-07 04:40:34,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 479 transitions. [2021-01-07 04:40:34,311 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 479 transitions. Word has length 81 [2021-01-07 04:40:34,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:40:34,311 INFO L481 AbstractCegarLoop]: Abstraction has 389 states and 479 transitions. [2021-01-07 04:40:34,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 04:40:34,312 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 479 transitions. [2021-01-07 04:40:34,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-01-07 04:40:34,316 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:40:34,317 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] [2021-01-07 04:40:34,531 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-07 04:40:34,532 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:40:34,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:40:34,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1914773501, now seen corresponding path program 1 times [2021-01-07 04:40:34,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:40:34,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441370627] [2021-01-07 04:40:34,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:40:34,553 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:40:34,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1477447371] [2021-01-07 04:40:34,554 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 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 [2021-01-07 04:40:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:40:34,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 17 conjunts are in the unsatisfiable core [2021-01-07 04:40:34,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:40:34,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 04:40:34,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441370627] [2021-01-07 04:40:34,970 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:40:34,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477447371] [2021-01-07 04:40:34,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:40:34,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2021-01-07 04:40:34,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436319495] [2021-01-07 04:40:34,972 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 04:40:34,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:40:34,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 04:40:34,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-07 04:40:34,973 INFO L87 Difference]: Start difference. First operand 389 states and 479 transitions. Second operand 6 states. [2021-01-07 04:40:35,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:40:35,181 INFO L93 Difference]: Finished difference Result 728 states and 905 transitions. [2021-01-07 04:40:35,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 04:40:35,182 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2021-01-07 04:40:35,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:40:35,184 INFO L225 Difference]: With dead ends: 728 [2021-01-07 04:40:35,184 INFO L226 Difference]: Without dead ends: 391 [2021-01-07 04:40:35,185 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-01-07 04:40:35,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2021-01-07 04:40:35,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2021-01-07 04:40:35,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2021-01-07 04:40:35,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 481 transitions. [2021-01-07 04:40:35,203 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 481 transitions. Word has length 83 [2021-01-07 04:40:35,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:40:35,203 INFO L481 AbstractCegarLoop]: Abstraction has 391 states and 481 transitions. [2021-01-07 04:40:35,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 04:40:35,203 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 481 transitions. [2021-01-07 04:40:35,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-07 04:40:35,204 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:40:35,204 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:40:35,418 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:40:35,419 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:40:35,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:40:35,420 INFO L82 PathProgramCache]: Analyzing trace with hash 931638948, now seen corresponding path program 2 times [2021-01-07 04:40:35,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:40:35,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928844674] [2021-01-07 04:40:35,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:40:35,438 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:40:35,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [852892525] [2021-01-07 04:40:35,439 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 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