/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_JEN_test4-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 04:24:45,813 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 04:24:45,816 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 04:24:45,855 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 04:24:45,856 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 04:24:45,858 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 04:24:45,860 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 04:24:45,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 04:24:45,865 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 04:24:45,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 04:24:45,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 04:24:45,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 04:24:45,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 04:24:45,872 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 04:24:45,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 04:24:45,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 04:24:45,877 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 04:24:45,878 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 04:24:45,881 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 04:24:45,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 04:24:45,886 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 04:24:45,887 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 04:24:45,889 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 04:24:45,890 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 04:24:45,901 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 04:24:45,901 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 04:24:45,902 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 04:24:45,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 04:24:45,906 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 04:24:45,908 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 04:24:45,908 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 04:24:45,912 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 04:24:45,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 04:24:45,917 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 04:24:45,928 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 04:24:45,930 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 04:24:45,931 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 04:24:45,931 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 04:24:45,932 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 04:24:45,936 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 04:24:45,937 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 04:24:45,940 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:24:45,992 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 04:24:45,993 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 04:24:45,997 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 04:24:45,998 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 04:24:45,998 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 04:24:45,999 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 04:24:45,999 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 04:24:45,999 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 04:24:45,999 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 04:24:45,999 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 04:24:46,001 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 04:24:46,001 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 04:24:46,001 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 04:24:46,002 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 04:24:46,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 04:24:46,002 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 04:24:46,002 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 04:24:46,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 04:24:46,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 04:24:46,003 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 04:24:46,003 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 04:24:46,003 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 04:24:46,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 04:24:46,004 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 04:24:46,004 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 04:24:46,004 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:24:46,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 04:24:46,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 04:24:46,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 04:24:46,525 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 04:24:46,525 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 04:24:46,527 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_JEN_test4-2.i [2021-01-07 04:24:46,609 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/08075de9f/ab354619e53746c2ae2cfa82e2eed410/FLAG7b7c9cb8c [2021-01-07 04:24:47,450 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 04:24:47,451 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-2.i [2021-01-07 04:24:47,474 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/08075de9f/ab354619e53746c2ae2cfa82e2eed410/FLAG7b7c9cb8c [2021-01-07 04:24:47,593 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/08075de9f/ab354619e53746c2ae2cfa82e2eed410 [2021-01-07 04:24:47,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 04:24:47,600 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 04:24:47,603 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 04:24:47,603 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 04:24:47,608 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 04:24:47,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 04:24:47" (1/1) ... [2021-01-07 04:24:47,613 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28b050d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:24:47, skipping insertion in model container [2021-01-07 04:24:47,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 04:24:47" (1/1) ... [2021-01-07 04:24:47,630 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 04:24:47,733 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-07 04:24:48,324 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_JEN_test4-2.i[33021,33034] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],StructAccessExpression[IdentifierExpression[~user~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem37,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem37,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem38,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem38,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem39,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem39,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem40,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem40,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem41,],base],StructAccessExpression[IdentifierExpression[#t~mem41,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem43,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem43,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem56,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem56,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem57,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem57,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem69,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem69,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~0,],base],StructAccessExpression[IdentifierExpression[~_ha_head~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_new_buckets~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem81,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem81,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem91,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem91,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem117,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem117,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem125,],base],StructAccessExpression[IdentifierExpression[#t~mem125,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem126,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem126,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem136,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem136,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[104],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem165,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem165,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem166,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem166,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem167,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem167,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem168,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem168,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,],base],StructAccessExpression[IdentifierExpression[#t~mem169,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem171,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem171,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~altusers~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem184,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem184,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem185,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem185,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem197,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem197,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~1,],base],StructAccessExpression[IdentifierExpression[~_ha_head~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_new_buckets~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem209,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem209,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem219,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem219,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem245,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem245,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem253,],base],StructAccessExpression[IdentifierExpression[#t~mem253,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem254,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem254,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem264,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem264,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem280,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem280,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem285,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem285,],offset],IdentifierExpression[#t~mem287,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem291,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem291,],offset],IdentifierExpression[#t~mem293,]]]]] 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~mem305,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem305,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem308,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem308,],offset]]]] [2021-01-07 04:24:48,521 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 04:24:48,535 INFO L203 MainTranslator]: Completed pre-run [2021-01-07 04:24:48,600 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_JEN_test4-2.i[33021,33034] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],StructAccessExpression[IdentifierExpression[~user~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem37,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem37,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem38,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem38,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem39,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem39,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem40,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem40,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem41,],base],StructAccessExpression[IdentifierExpression[#t~mem41,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem43,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem43,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem56,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem56,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem57,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem57,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem69,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem69,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~0,],base],StructAccessExpression[IdentifierExpression[~_ha_head~0,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~#_he_new_buckets~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem83,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem83,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem93,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem93,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem120,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem120,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem128,],base],StructAccessExpression[IdentifierExpression[#t~mem128,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem130,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem130,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem140,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem140,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[104],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem169,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem170,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem170,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem171,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem171,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem172,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem172,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem173,],base],StructAccessExpression[IdentifierExpression[#t~mem173,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem175,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem175,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~altusers~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem188,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem188,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem189,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem189,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem201,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem201,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~1,],base],StructAccessExpression[IdentifierExpression[~_ha_head~1,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~#_he_new_buckets~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem215,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem215,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem225,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem225,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem252,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem252,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem260,],base],StructAccessExpression[IdentifierExpression[#t~mem260,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem262,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem262,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem272,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem272,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem288,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem288,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem293,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem293,],offset],IdentifierExpression[#t~mem295,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem299,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem299,],offset],IdentifierExpression[#t~mem301,]]]]] 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~mem313,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem313,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem316,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem316,],offset]]]] [2021-01-07 04:24:48,777 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 04:24:48,866 INFO L208 MainTranslator]: Completed translation [2021-01-07 04:24:48,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:24:48 WrapperNode [2021-01-07 04:24:48,867 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 04:24:48,868 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 04:24:48,869 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 04:24:48,869 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 04:24:48,878 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:24:48" (1/1) ... [2021-01-07 04:24:48,921 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:24:48" (1/1) ... [2021-01-07 04:24:49,023 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 04:24:49,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 04:24:49,024 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 04:24:49,024 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 04:24:49,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:24:48" (1/1) ... [2021-01-07 04:24:49,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:24:48" (1/1) ... [2021-01-07 04:24:49,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:24:48" (1/1) ... [2021-01-07 04:24:49,073 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:24:48" (1/1) ... [2021-01-07 04:24:49,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:24:48" (1/1) ... [2021-01-07 04:24:49,206 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:24:48" (1/1) ... [2021-01-07 04:24:49,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:24:48" (1/1) ... [2021-01-07 04:24:49,254 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 04:24:49,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 04:24:49,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 04:24:49,256 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 04:24:49,258 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:24:48" (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:24:49,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 04:24:49,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 04:24:49,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 04:24:49,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 04:24:49,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 04:24:49,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 04:24:49,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 04:24:49,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 04:24:49,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 04:24:49,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 04:24:52,247 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 04:24:52,248 INFO L299 CfgBuilder]: Removed 107 assume(true) statements. [2021-01-07 04:24:52,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 04:24:52 BoogieIcfgContainer [2021-01-07 04:24:52,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 04:24:52,253 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 04:24:52,253 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 04:24:52,257 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 04:24:52,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 04:24:47" (1/3) ... [2021-01-07 04:24:52,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6063a1a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 04:24:52, skipping insertion in model container [2021-01-07 04:24:52,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:24:48" (2/3) ... [2021-01-07 04:24:52,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6063a1a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 04:24:52, skipping insertion in model container [2021-01-07 04:24:52,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 04:24:52" (3/3) ... [2021-01-07 04:24:52,260 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test4-2.i [2021-01-07 04:24:52,267 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 04:24:52,273 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2021-01-07 04:24:52,294 INFO L253 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2021-01-07 04:24:52,328 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 04:24:52,328 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 04:24:52,328 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 04:24:52,329 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 04:24:52,329 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 04:24:52,329 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 04:24:52,329 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 04:24:52,329 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 04:24:52,356 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states. [2021-01-07 04:24:52,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-01-07 04:24:52,364 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:24:52,365 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:24:52,365 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:24:52,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:24:52,373 INFO L82 PathProgramCache]: Analyzing trace with hash 889550569, now seen corresponding path program 1 times [2021-01-07 04:24:52,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:24:52,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567664876] [2021-01-07 04:24:52,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:24:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:24:52,593 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:24:52,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567664876] [2021-01-07 04:24:52,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:24:52,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 04:24:52,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288727739] [2021-01-07 04:24:52,602 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-07 04:24:52,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:24:52,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-07 04:24:52,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 04:24:52,621 INFO L87 Difference]: Start difference. First operand 250 states. Second operand 2 states. [2021-01-07 04:24:52,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:24:52,677 INFO L93 Difference]: Finished difference Result 498 states and 822 transitions. [2021-01-07 04:24:52,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-07 04:24:52,681 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2021-01-07 04:24:52,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:24:52,707 INFO L225 Difference]: With dead ends: 498 [2021-01-07 04:24:52,707 INFO L226 Difference]: Without dead ends: 217 [2021-01-07 04:24:52,718 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:24:52,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-01-07 04:24:52,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2021-01-07 04:24:52,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2021-01-07 04:24:52,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 282 transitions. [2021-01-07 04:24:52,816 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 282 transitions. Word has length 8 [2021-01-07 04:24:52,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:24:52,817 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 282 transitions. [2021-01-07 04:24:52,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-07 04:24:52,818 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 282 transitions. [2021-01-07 04:24:52,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-01-07 04:24:52,819 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:24:52,819 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:24:52,820 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 04:24:52,821 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:24:52,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:24:52,822 INFO L82 PathProgramCache]: Analyzing trace with hash 921152950, now seen corresponding path program 1 times [2021-01-07 04:24:52,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:24:52,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82066120] [2021-01-07 04:24:52,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:24:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:24:52,927 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:24:52,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82066120] [2021-01-07 04:24:52,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:24:52,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:24:52,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118756301] [2021-01-07 04:24:52,931 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:24:52,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:24:52,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:24:52,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:24:52,933 INFO L87 Difference]: Start difference. First operand 217 states and 282 transitions. Second operand 3 states. [2021-01-07 04:24:53,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:24:53,013 INFO L93 Difference]: Finished difference Result 432 states and 562 transitions. [2021-01-07 04:24:53,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:24:53,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2021-01-07 04:24:53,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:24:53,023 INFO L225 Difference]: With dead ends: 432 [2021-01-07 04:24:53,024 INFO L226 Difference]: Without dead ends: 387 [2021-01-07 04:24:53,026 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:24:53,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-01-07 04:24:53,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 218. [2021-01-07 04:24:53,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2021-01-07 04:24:53,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 283 transitions. [2021-01-07 04:24:53,064 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 283 transitions. Word has length 8 [2021-01-07 04:24:53,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:24:53,064 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 283 transitions. [2021-01-07 04:24:53,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:24:53,064 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 283 transitions. [2021-01-07 04:24:53,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-07 04:24:53,072 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:24:53,072 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:24:53,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 04:24:53,074 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:24:53,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:24:53,076 INFO L82 PathProgramCache]: Analyzing trace with hash -137963571, now seen corresponding path program 1 times [2021-01-07 04:24:53,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:24:53,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639322527] [2021-01-07 04:24:53,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:24:53,139 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:24:53,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1524434203] [2021-01-07 04:24:53,140 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:24:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:24:53,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:24:53,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:24:53,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:24:53,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639322527] [2021-01-07 04:24:53,722 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:24:53,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524434203] [2021-01-07 04:24:53,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:24:53,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:24:53,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096483447] [2021-01-07 04:24:53,731 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:24:53,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:24:53,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:24:53,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:24:53,735 INFO L87 Difference]: Start difference. First operand 218 states and 283 transitions. Second operand 3 states. [2021-01-07 04:24:53,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:24:53,856 INFO L93 Difference]: Finished difference Result 454 states and 594 transitions. [2021-01-07 04:24:53,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:24:53,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2021-01-07 04:24:53,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:24:53,859 INFO L225 Difference]: With dead ends: 454 [2021-01-07 04:24:53,859 INFO L226 Difference]: Without dead ends: 239 [2021-01-07 04:24:53,861 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:24:53,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-01-07 04:24:53,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 238. [2021-01-07 04:24:53,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2021-01-07 04:24:53,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 303 transitions. [2021-01-07 04:24:53,885 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 303 transitions. Word has length 106 [2021-01-07 04:24:53,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:24:53,887 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 303 transitions. [2021-01-07 04:24:53,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:24:53,888 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 303 transitions. [2021-01-07 04:24:53,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-07 04:24:53,892 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:24:53,892 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:24:54,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-01-07 04:24:54,108 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:24:54,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:24:54,109 INFO L82 PathProgramCache]: Analyzing trace with hash 62310097, now seen corresponding path program 1 times [2021-01-07 04:24:54,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:24:54,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956214905] [2021-01-07 04:24:54,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:24:54,136 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:24:54,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1320604441] [2021-01-07 04:24:54,137 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:24:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:24:54,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:24:54,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:24:54,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:24:54,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956214905] [2021-01-07 04:24:54,592 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:24:54,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320604441] [2021-01-07 04:24:54,592 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:24:54,592 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:24:54,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147427121] [2021-01-07 04:24:54,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:24:54,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:24:54,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:24:54,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:24:54,594 INFO L87 Difference]: Start difference. First operand 238 states and 303 transitions. Second operand 3 states. [2021-01-07 04:24:54,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:24:54,689 INFO L93 Difference]: Finished difference Result 494 states and 634 transitions. [2021-01-07 04:24:54,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:24:54,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2021-01-07 04:24:54,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:24:54,692 INFO L225 Difference]: With dead ends: 494 [2021-01-07 04:24:54,692 INFO L226 Difference]: Without dead ends: 259 [2021-01-07 04:24:54,693 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:24:54,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-01-07 04:24:54,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 258. [2021-01-07 04:24:54,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2021-01-07 04:24:54,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 323 transitions. [2021-01-07 04:24:54,701 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 323 transitions. Word has length 106 [2021-01-07 04:24:54,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:24:54,702 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 323 transitions. [2021-01-07 04:24:54,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:24:54,702 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 323 transitions. [2021-01-07 04:24:54,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-07 04:24:54,704 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:24:54,704 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:24:54,917 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:24:54,918 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:24:54,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:24:54,920 INFO L82 PathProgramCache]: Analyzing trace with hash -426500019, now seen corresponding path program 1 times [2021-01-07 04:24:54,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:24:54,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753669661] [2021-01-07 04:24:54,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:24:54,944 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:24:54,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1834445861] [2021-01-07 04:24:54,945 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:24:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:24:55,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:24:55,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:24:55,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:24:55,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753669661] [2021-01-07 04:24:55,399 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:24:55,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834445861] [2021-01-07 04:24:55,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:24:55,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:24:55,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570459323] [2021-01-07 04:24:55,400 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:24:55,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:24:55,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:24:55,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:24:55,402 INFO L87 Difference]: Start difference. First operand 258 states and 323 transitions. Second operand 4 states. [2021-01-07 04:24:55,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:24:55,508 INFO L93 Difference]: Finished difference Result 505 states and 635 transitions. [2021-01-07 04:24:55,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:24:55,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2021-01-07 04:24:55,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:24:55,510 INFO L225 Difference]: With dead ends: 505 [2021-01-07 04:24:55,510 INFO L226 Difference]: Without dead ends: 250 [2021-01-07 04:24:55,511 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:24:55,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-01-07 04:24:55,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 244. [2021-01-07 04:24:55,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2021-01-07 04:24:55,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 302 transitions. [2021-01-07 04:24:55,519 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 302 transitions. Word has length 106 [2021-01-07 04:24:55,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:24:55,519 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 302 transitions. [2021-01-07 04:24:55,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:24:55,520 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 302 transitions. [2021-01-07 04:24:55,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-07 04:24:55,521 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:24:55,521 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:24:55,734 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:24:55,735 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:24:55,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:24:55,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1791075329, now seen corresponding path program 1 times [2021-01-07 04:24:55,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:24:55,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217414890] [2021-01-07 04:24:55,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:24:55,764 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:24:55,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1096805543] [2021-01-07 04:24:55,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:24:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:24:56,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:24:56,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:24:56,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:24:56,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217414890] [2021-01-07 04:24:56,232 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:24:56,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096805543] [2021-01-07 04:24:56,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:24:56,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:24:56,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492403890] [2021-01-07 04:24:56,234 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:24:56,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:24:56,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:24:56,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:24:56,235 INFO L87 Difference]: Start difference. First operand 244 states and 302 transitions. Second operand 4 states. [2021-01-07 04:24:56,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:24:56,333 INFO L93 Difference]: Finished difference Result 566 states and 702 transitions. [2021-01-07 04:24:56,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:24:56,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2021-01-07 04:24:56,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:24:56,336 INFO L225 Difference]: With dead ends: 566 [2021-01-07 04:24:56,337 INFO L226 Difference]: Without dead ends: 325 [2021-01-07 04:24:56,338 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:24:56,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-01-07 04:24:56,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 230. [2021-01-07 04:24:56,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2021-01-07 04:24:56,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 281 transitions. [2021-01-07 04:24:56,346 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 281 transitions. Word has length 106 [2021-01-07 04:24:56,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:24:56,347 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 281 transitions. [2021-01-07 04:24:56,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:24:56,347 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 281 transitions. [2021-01-07 04:24:56,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-07 04:24:56,348 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:24:56,348 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:24:56,562 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:24:56,563 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:24:56,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:24:56,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1369189005, now seen corresponding path program 1 times [2021-01-07 04:24:56,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:24:56,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899635627] [2021-01-07 04:24:56,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:24:56,590 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:24:56,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [322554957] [2021-01-07 04:24:56,591 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:24:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:24:56,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:24:56,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:24:57,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:24:57,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899635627] [2021-01-07 04:24:57,039 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:24:57,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322554957] [2021-01-07 04:24:57,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:24:57,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2021-01-07 04:24:57,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383224228] [2021-01-07 04:24:57,041 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:24:57,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:24:57,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:24:57,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:24:57,042 INFO L87 Difference]: Start difference. First operand 230 states and 281 transitions. Second operand 4 states. [2021-01-07 04:24:57,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:24:57,085 INFO L93 Difference]: Finished difference Result 638 states and 780 transitions. [2021-01-07 04:24:57,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:24:57,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2021-01-07 04:24:57,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:24:57,089 INFO L225 Difference]: With dead ends: 638 [2021-01-07 04:24:57,090 INFO L226 Difference]: Without dead ends: 593 [2021-01-07 04:24:57,090 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:24:57,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2021-01-07 04:24:57,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 412. [2021-01-07 04:24:57,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2021-01-07 04:24:57,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 503 transitions. [2021-01-07 04:24:57,107 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 503 transitions. Word has length 106 [2021-01-07 04:24:57,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:24:57,107 INFO L481 AbstractCegarLoop]: Abstraction has 412 states and 503 transitions. [2021-01-07 04:24:57,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:24:57,108 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 503 transitions. [2021-01-07 04:24:57,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2021-01-07 04:24:57,110 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:24:57,110 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:24:57,325 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-01-07 04:24:57,326 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:24:57,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:24:57,327 INFO L82 PathProgramCache]: Analyzing trace with hash 548829604, now seen corresponding path program 2 times [2021-01-07 04:24:57,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:24:57,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069567226] [2021-01-07 04:24:57,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:24:57,358 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:24:57,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1146083249] [2021-01-07 04:24:57,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:24:57,608 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-01-07 04:24:57,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:24:57,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2021-01-07 04:24:57,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:24:58,042 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-01-07 04:24:58,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069567226] [2021-01-07 04:24:58,043 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:24:58,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146083249] [2021-01-07 04:24:58,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:24:58,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:24:58,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757809018] [2021-01-07 04:24:58,044 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:24:58,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:24:58,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:24:58,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:24:58,045 INFO L87 Difference]: Start difference. First operand 412 states and 503 transitions. Second operand 4 states. [2021-01-07 04:24:58,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:24:58,502 INFO L93 Difference]: Finished difference Result 677 states and 831 transitions. [2021-01-07 04:24:58,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:24:58,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2021-01-07 04:24:58,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:24:58,510 INFO L225 Difference]: With dead ends: 677 [2021-01-07 04:24:58,510 INFO L226 Difference]: Without dead ends: 410 [2021-01-07 04:24:58,511 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:24:58,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-01-07 04:24:58,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2021-01-07 04:24:58,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2021-01-07 04:24:58,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 500 transitions. [2021-01-07 04:24:58,544 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 500 transitions. Word has length 204 [2021-01-07 04:24:58,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:24:58,545 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 500 transitions. [2021-01-07 04:24:58,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:24:58,545 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 500 transitions. [2021-01-07 04:24:58,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2021-01-07 04:24:58,548 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:24:58,548 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:24:58,764 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:24:58,765 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:24:58,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:24:58,766 INFO L82 PathProgramCache]: Analyzing trace with hash -7696284, now seen corresponding path program 1 times [2021-01-07 04:24:58,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:24:58,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137712994] [2021-01-07 04:24:58,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:24:58,793 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:24:58,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1692747038] [2021-01-07 04:24:58,794 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:24:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:24:59,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:24:59,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:24:59,410 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-01-07 04:24:59,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137712994] [2021-01-07 04:24:59,411 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:24:59,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692747038] [2021-01-07 04:24:59,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:24:59,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:24:59,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245516185] [2021-01-07 04:24:59,413 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:24:59,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:24:59,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:24:59,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:24:59,414 INFO L87 Difference]: Start difference. First operand 410 states and 500 transitions. Second operand 3 states. [2021-01-07 04:24:59,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:24:59,492 INFO L93 Difference]: Finished difference Result 776 states and 957 transitions. [2021-01-07 04:24:59,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:24:59,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2021-01-07 04:24:59,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:24:59,495 INFO L225 Difference]: With dead ends: 776 [2021-01-07 04:24:59,495 INFO L226 Difference]: Without dead ends: 418 [2021-01-07 04:24:59,497 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:24:59,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-01-07 04:24:59,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2021-01-07 04:24:59,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2021-01-07 04:24:59,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 508 transitions. [2021-01-07 04:24:59,513 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 508 transitions. Word has length 211 [2021-01-07 04:24:59,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:24:59,514 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 508 transitions. [2021-01-07 04:24:59,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:24:59,514 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 508 transitions. [2021-01-07 04:24:59,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2021-01-07 04:24:59,517 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:24:59,517 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:24:59,730 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:24:59,731 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:24:59,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:24:59,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1887603621, now seen corresponding path program 1 times [2021-01-07 04:24:59,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:24:59,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231724413] [2021-01-07 04:24:59,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:24:59,759 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:24:59,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [429403392] [2021-01-07 04:24:59,760 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:25:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:25:00,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 04:25:00,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:25:00,401 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-01-07 04:25:00,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231724413] [2021-01-07 04:25:00,402 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:25:00,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429403392] [2021-01-07 04:25:00,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:25:00,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2021-01-07 04:25:00,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984856098] [2021-01-07 04:25:00,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:25:00,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:25:00,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:25:00,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:25:00,405 INFO L87 Difference]: Start difference. First operand 418 states and 508 transitions. Second operand 4 states. [2021-01-07 04:25:00,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:25:00,481 INFO L93 Difference]: Finished difference Result 791 states and 972 transitions. [2021-01-07 04:25:00,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:25:00,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2021-01-07 04:25:00,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:25:00,484 INFO L225 Difference]: With dead ends: 791 [2021-01-07 04:25:00,484 INFO L226 Difference]: Without dead ends: 426 [2021-01-07 04:25:00,485 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:25:00,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2021-01-07 04:25:00,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2021-01-07 04:25:00,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2021-01-07 04:25:00,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 516 transitions. [2021-01-07 04:25:00,501 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 516 transitions. Word has length 213 [2021-01-07 04:25:00,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:25:00,502 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 516 transitions. [2021-01-07 04:25:00,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:25:00,502 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 516 transitions. [2021-01-07 04:25:00,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2021-01-07 04:25:00,505 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:25:00,506 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:25:00,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-07 04:25:00,721 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:25:00,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:25:00,722 INFO L82 PathProgramCache]: Analyzing trace with hash -546185468, now seen corresponding path program 2 times [2021-01-07 04:25:00,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:25:00,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121666539] [2021-01-07 04:25:00,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:25:00,749 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:25:00,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1542341024] [2021-01-07 04:25:00,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:25:01,215 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 04:25:01,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:25:01,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 04:25:01,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:25:01,444 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 84 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-07 04:25:01,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121666539] [2021-01-07 04:25:01,445 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:25:01,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542341024] [2021-01-07 04:25:01,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:25:01,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2021-01-07 04:25:01,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99594823] [2021-01-07 04:25:01,447 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 04:25:01,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:25:01,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 04:25:01,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:25:01,448 INFO L87 Difference]: Start difference. First operand 426 states and 516 transitions. Second operand 5 states. [2021-01-07 04:25:01,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:25:01,538 INFO L93 Difference]: Finished difference Result 806 states and 987 transitions. [2021-01-07 04:25:01,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 04:25:01,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 215 [2021-01-07 04:25:01,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:25:01,541 INFO L225 Difference]: With dead ends: 806 [2021-01-07 04:25:01,542 INFO L226 Difference]: Without dead ends: 434 [2021-01-07 04:25:01,543 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:25:01,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2021-01-07 04:25:01,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2021-01-07 04:25:01,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2021-01-07 04:25:01,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 524 transitions. [2021-01-07 04:25:01,562 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 524 transitions. Word has length 215 [2021-01-07 04:25:01,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:25:01,563 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 524 transitions. [2021-01-07 04:25:01,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 04:25:01,563 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 524 transitions. [2021-01-07 04:25:01,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2021-01-07 04:25:01,566 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:25:01,567 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:25:01,779 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:25:01,780 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:25:01,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:25:01,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1962229253, now seen corresponding path program 3 times [2021-01-07 04:25:01,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:25:01,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992107143] [2021-01-07 04:25:01,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:25:01,817 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:25:01,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1580819511] [2021-01-07 04:25:01,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:25:02,158 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-01-07 04:25:02,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:25:02,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 04:25:02,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:25:02,486 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-01-07 04:25:02,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992107143] [2021-01-07 04:25:02,487 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:25:02,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580819511] [2021-01-07 04:25:02,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:25:02,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:25:02,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495343189] [2021-01-07 04:25:02,488 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:25:02,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:25:02,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:25:02,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:25:02,489 INFO L87 Difference]: Start difference. First operand 434 states and 524 transitions. Second operand 3 states. [2021-01-07 04:25:02,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:25:02,568 INFO L93 Difference]: Finished difference Result 804 states and 976 transitions. [2021-01-07 04:25:02,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:25:02,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2021-01-07 04:25:02,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:25:02,576 INFO L225 Difference]: With dead ends: 804 [2021-01-07 04:25:02,576 INFO L226 Difference]: Without dead ends: 432 [2021-01-07 04:25:02,577 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:25:02,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2021-01-07 04:25:02,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2021-01-07 04:25:02,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2021-01-07 04:25:02,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 521 transitions. [2021-01-07 04:25:02,593 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 521 transitions. Word has length 217 [2021-01-07 04:25:02,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:25:02,593 INFO L481 AbstractCegarLoop]: Abstraction has 432 states and 521 transitions. [2021-01-07 04:25:02,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:25:02,593 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 521 transitions. [2021-01-07 04:25:02,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2021-01-07 04:25:02,597 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:25:02,597 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:25:02,810 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:25:02,811 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:25:02,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:25:02,812 INFO L82 PathProgramCache]: Analyzing trace with hash -511436746, now seen corresponding path program 1 times [2021-01-07 04:25:02,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:25:02,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514394127] [2021-01-07 04:25:02,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:25:02,837 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:25:02,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [167752602] [2021-01-07 04:25:02,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:25:03,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:25:03,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-07 04:25:03,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:25:03,596 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-01-07 04:25:03,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514394127] [2021-01-07 04:25:03,596 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:25:03,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167752602] [2021-01-07 04:25:03,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:25:03,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2021-01-07 04:25:03,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162785679] [2021-01-07 04:25:03,598 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 04:25:03,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:25:03,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 04:25:03,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-07 04:25:03,599 INFO L87 Difference]: Start difference. First operand 432 states and 521 transitions. Second operand 6 states. [2021-01-07 04:25:03,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:25:03,708 INFO L93 Difference]: Finished difference Result 819 states and 999 transitions. [2021-01-07 04:25:03,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 04:25:03,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 230 [2021-01-07 04:25:03,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:25:03,711 INFO L225 Difference]: With dead ends: 819 [2021-01-07 04:25:03,711 INFO L226 Difference]: Without dead ends: 440 [2021-01-07 04:25:03,712 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-07 04:25:03,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-01-07 04:25:03,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2021-01-07 04:25:03,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2021-01-07 04:25:03,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 529 transitions. [2021-01-07 04:25:03,729 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 529 transitions. Word has length 230 [2021-01-07 04:25:03,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:25:03,729 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 529 transitions. [2021-01-07 04:25:03,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 04:25:03,729 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 529 transitions. [2021-01-07 04:25:03,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2021-01-07 04:25:03,733 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:25:03,733 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:25:03,947 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-01-07 04:25:03,948 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:25:03,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:25:03,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1844438796, now seen corresponding path program 2 times [2021-01-07 04:25:03,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:25:03,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549004574] [2021-01-07 04:25:03,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:25:03,972 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:25:03,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [53407720] [2021-01-07 04:25:03,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:25:04,452 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 04:25:04,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:25:04,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-07 04:25:04,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:25:04,744 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2021-01-07 04:25:04,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549004574] [2021-01-07 04:25:04,745 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:25:04,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53407720] [2021-01-07 04:25:04,745 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:25:04,745 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-01-07 04:25:04,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836068145] [2021-01-07 04:25:04,746 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 04:25:04,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:25:04,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 04:25:04,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-07 04:25:04,747 INFO L87 Difference]: Start difference. First operand 440 states and 529 transitions. Second operand 7 states. [2021-01-07 04:25:04,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:25:04,873 INFO L93 Difference]: Finished difference Result 834 states and 1014 transitions. [2021-01-07 04:25:04,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 04:25:04,874 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 234 [2021-01-07 04:25:04,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:25:04,876 INFO L225 Difference]: With dead ends: 834 [2021-01-07 04:25:04,877 INFO L226 Difference]: Without dead ends: 448 [2021-01-07 04:25:04,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-07 04:25:04,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-01-07 04:25:04,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2021-01-07 04:25:04,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2021-01-07 04:25:04,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 537 transitions. [2021-01-07 04:25:04,895 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 537 transitions. Word has length 234 [2021-01-07 04:25:04,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:25:04,895 INFO L481 AbstractCegarLoop]: Abstraction has 448 states and 537 transitions. [2021-01-07 04:25:04,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 04:25:04,895 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 537 transitions. [2021-01-07 04:25:04,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-01-07 04:25:04,897 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:25:04,897 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:25:05,111 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-07 04:25:05,112 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:25:05,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:25:05,113 INFO L82 PathProgramCache]: Analyzing trace with hash 951531638, now seen corresponding path program 3 times [2021-01-07 04:25:05,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:25:05,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773822697] [2021-01-07 04:25:05,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:25:05,136 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:25:05,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1612030662] [2021-01-07 04:25:05,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true