/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 04:29:32,029 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 04:29:32,034 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 04:29:32,096 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 04:29:32,097 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 04:29:32,101 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 04:29:32,106 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 04:29:32,112 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 04:29:32,116 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 04:29:32,122 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 04:29:32,127 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 04:29:32,129 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 04:29:32,130 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 04:29:32,134 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 04:29:32,136 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 04:29:32,138 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 04:29:32,140 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 04:29:32,144 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 04:29:32,154 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 04:29:32,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 04:29:32,173 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 04:29:32,175 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 04:29:32,177 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 04:29:32,180 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 04:29:32,187 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 04:29:32,192 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 04:29:32,193 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 04:29:32,194 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 04:29:32,194 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 04:29:32,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 04:29:32,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 04:29:32,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 04:29:32,201 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 04:29:32,202 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 04:29:32,204 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 04:29:32,204 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 04:29:32,205 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 04:29:32,205 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 04:29:32,205 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 04:29:32,207 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 04:29:32,207 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 04:29:32,211 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:29:32,265 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 04:29:32,266 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 04:29:32,270 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 04:29:32,270 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 04:29:32,270 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 04:29:32,271 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 04:29:32,271 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 04:29:32,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 04:29:32,271 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 04:29:32,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 04:29:32,272 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 04:29:32,273 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 04:29:32,273 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 04:29:32,273 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 04:29:32,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 04:29:32,274 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 04:29:32,274 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 04:29:32,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 04:29:32,274 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 04:29:32,274 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 04:29:32,275 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 04:29:32,275 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 04:29:32,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 04:29:32,275 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 04:29:32,275 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 04:29:32,275 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:29:32,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 04:29:32,820 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 04:29:32,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 04:29:32,825 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 04:29:32,826 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 04:29:32,827 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-1.i [2021-01-07 04:29:32,920 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/16c27318d/c82d7b0aa55b438fac9c608ffd2797b7/FLAGe24c636b0 [2021-01-07 04:29:33,811 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 04:29:33,812 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-1.i [2021-01-07 04:29:33,850 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/16c27318d/c82d7b0aa55b438fac9c608ffd2797b7/FLAGe24c636b0 [2021-01-07 04:29:33,928 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/16c27318d/c82d7b0aa55b438fac9c608ffd2797b7 [2021-01-07 04:29:33,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 04:29:33,936 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 04:29:33,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 04:29:33,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 04:29:33,943 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 04:29:33,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 04:29:33" (1/1) ... [2021-01-07 04:29:33,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6161ddc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:29:33, skipping insertion in model container [2021-01-07 04:29:33,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 04:29:33" (1/1) ... [2021-01-07 04:29:33,961 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 04:29:34,049 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-07 04:29:34,738 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-1.i[33022,33035] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],StructAccessExpression[IdentifierExpression[~user~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem37,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem37,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem38,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem38,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem39,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem39,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem40,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem40,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem41,],base],StructAccessExpression[IdentifierExpression[#t~mem41,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem43,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem43,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem56,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem56,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem57,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem57,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem69,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem69,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~0,],base],StructAccessExpression[IdentifierExpression[~_ha_head~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_new_buckets~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem81,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem81,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem91,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem91,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem117,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem117,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem125,],base],StructAccessExpression[IdentifierExpression[#t~mem125,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem126,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem126,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem136,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem136,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[104],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem165,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem165,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem166,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem166,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem167,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem167,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem168,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem168,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,],base],StructAccessExpression[IdentifierExpression[#t~mem169,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem171,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem171,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~altusers~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem184,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem184,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem185,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem185,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem197,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem197,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~1,],base],StructAccessExpression[IdentifierExpression[~_ha_head~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_new_buckets~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem209,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem209,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem219,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem219,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem245,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem245,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem253,],base],StructAccessExpression[IdentifierExpression[#t~mem253,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem254,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem254,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem264,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem264,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~3,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~3,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~4,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~4,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~3,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~5,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~5,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] [2021-01-07 04:29:35,184 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 04:29:35,206 INFO L203 MainTranslator]: Completed pre-run [2021-01-07 04:29:35,241 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-1.i[33022,33035] left hand side expression in assignment: address: IdentifierExpression[~#i~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],StructAccessExpression[IdentifierExpression[~user~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem43,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem43,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem44,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem44,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem45,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem45,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem46,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem46,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem47,],base],StructAccessExpression[IdentifierExpression[#t~mem47,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem49,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem49,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem62,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem62,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem63,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem63,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem75,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem75,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~0,],base],StructAccessExpression[IdentifierExpression[~_ha_head~0,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~#_he_new_buckets~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem89,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem89,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem99,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem99,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem126,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem126,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem134,],base],StructAccessExpression[IdentifierExpression[#t~mem134,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem136,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem136,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem146,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem146,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[104],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem175,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem175,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem176,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem176,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem177,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem177,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem178,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem178,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem179,],base],StructAccessExpression[IdentifierExpression[#t~mem179,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem181,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem181,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~altusers~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem194,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem194,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem195,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem195,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem207,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem207,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~1,],base],StructAccessExpression[IdentifierExpression[~_ha_head~1,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~#_he_new_buckets~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem221,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem221,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem231,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem231,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem258,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem258,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem266,],base],StructAccessExpression[IdentifierExpression[#t~mem266,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem268,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem268,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem278,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem278,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~#i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~3,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~3,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: address: IdentifierExpression[~#i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~4,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~4,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~3,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~5,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~5,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] [2021-01-07 04:29:35,462 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 04:29:35,577 INFO L208 MainTranslator]: Completed translation [2021-01-07 04:29:35,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:29:35 WrapperNode [2021-01-07 04:29:35,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 04:29:35,581 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 04:29:35,581 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 04:29:35,581 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 04:29:35,591 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:29:35" (1/1) ... [2021-01-07 04:29:35,684 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:29:35" (1/1) ... [2021-01-07 04:29:35,834 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 04:29:35,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 04:29:35,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 04:29:35,837 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 04:29:35,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:29:35" (1/1) ... [2021-01-07 04:29:35,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:29:35" (1/1) ... [2021-01-07 04:29:35,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:29:35" (1/1) ... [2021-01-07 04:29:35,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:29:35" (1/1) ... [2021-01-07 04:29:35,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:29:35" (1/1) ... [2021-01-07 04:29:36,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:29:35" (1/1) ... [2021-01-07 04:29:36,035 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:29:35" (1/1) ... [2021-01-07 04:29:36,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 04:29:36,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 04:29:36,058 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 04:29:36,058 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 04:29:36,059 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:29:35" (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:29:36,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 04:29:36,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 04:29:36,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 04:29:36,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 04:29:36,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 04:29:36,177 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-01-07 04:29:36,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 04:29:36,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 04:29:36,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 04:29:36,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 04:29:36,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 04:29:39,804 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 04:29:39,805 INFO L299 CfgBuilder]: Removed 207 assume(true) statements. [2021-01-07 04:29:39,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 04:29:39 BoogieIcfgContainer [2021-01-07 04:29:39,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 04:29:39,812 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 04:29:39,812 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 04:29:39,816 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 04:29:39,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 04:29:33" (1/3) ... [2021-01-07 04:29:39,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51f05a02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 04:29:39, skipping insertion in model container [2021-01-07 04:29:39,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:29:35" (2/3) ... [2021-01-07 04:29:39,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51f05a02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 04:29:39, skipping insertion in model container [2021-01-07 04:29:39,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 04:29:39" (3/3) ... [2021-01-07 04:29:39,820 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test10-1.i [2021-01-07 04:29:39,833 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 04:29:39,840 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2021-01-07 04:29:39,864 INFO L253 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2021-01-07 04:29:39,918 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 04:29:39,918 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 04:29:39,919 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 04:29:39,919 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 04:29:39,919 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 04:29:39,919 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 04:29:39,919 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 04:29:39,919 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 04:29:39,967 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states. [2021-01-07 04:29:39,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-01-07 04:29:39,979 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:29:39,980 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:29:39,981 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:29:39,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:29:39,988 INFO L82 PathProgramCache]: Analyzing trace with hash -128377380, now seen corresponding path program 1 times [2021-01-07 04:29:40,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:29:40,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792354128] [2021-01-07 04:29:40,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:29:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:29:40,244 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:29:40,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792354128] [2021-01-07 04:29:40,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:29:40,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 04:29:40,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920735220] [2021-01-07 04:29:40,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-07 04:29:40,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:29:40,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-07 04:29:40,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 04:29:40,288 INFO L87 Difference]: Start difference. First operand 470 states. Second operand 2 states. [2021-01-07 04:29:40,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:29:40,408 INFO L93 Difference]: Finished difference Result 938 states and 1580 transitions. [2021-01-07 04:29:40,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-07 04:29:40,410 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2021-01-07 04:29:40,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:29:40,441 INFO L225 Difference]: With dead ends: 938 [2021-01-07 04:29:40,441 INFO L226 Difference]: Without dead ends: 465 [2021-01-07 04:29:40,454 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:29:40,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2021-01-07 04:29:40,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2021-01-07 04:29:40,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2021-01-07 04:29:40,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 608 transitions. [2021-01-07 04:29:40,576 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 608 transitions. Word has length 9 [2021-01-07 04:29:40,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:29:40,577 INFO L481 AbstractCegarLoop]: Abstraction has 465 states and 608 transitions. [2021-01-07 04:29:40,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-07 04:29:40,578 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 608 transitions. [2021-01-07 04:29:40,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 04:29:40,582 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:29:40,583 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:29:40,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 04:29:40,587 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:29:40,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:29:40,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1568739198, now seen corresponding path program 1 times [2021-01-07 04:29:40,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:29:40,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194378811] [2021-01-07 04:29:40,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:29:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:29:40,845 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:29:40,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194378811] [2021-01-07 04:29:40,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:29:40,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:29:40,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185552642] [2021-01-07 04:29:40,850 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:29:40,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:29:40,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:29:40,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:29:40,853 INFO L87 Difference]: Start difference. First operand 465 states and 608 transitions. Second operand 4 states. [2021-01-07 04:29:42,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:29:42,017 INFO L93 Difference]: Finished difference Result 831 states and 1087 transitions. [2021-01-07 04:29:42,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:29:42,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2021-01-07 04:29:42,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:29:42,021 INFO L225 Difference]: With dead ends: 831 [2021-01-07 04:29:42,021 INFO L226 Difference]: Without dead ends: 540 [2021-01-07 04:29:42,024 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:29:42,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2021-01-07 04:29:42,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 467. [2021-01-07 04:29:42,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2021-01-07 04:29:42,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 610 transitions. [2021-01-07 04:29:42,049 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 610 transitions. Word has length 44 [2021-01-07 04:29:42,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:29:42,049 INFO L481 AbstractCegarLoop]: Abstraction has 467 states and 610 transitions. [2021-01-07 04:29:42,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:29:42,049 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 610 transitions. [2021-01-07 04:29:42,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-01-07 04:29:42,063 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:29:42,064 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:29:42,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 04:29:42,066 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:29:42,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:29:42,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1325558428, now seen corresponding path program 1 times [2021-01-07 04:29:42,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:29:42,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970265160] [2021-01-07 04:29:42,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:29:42,137 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:29:42,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1339590111] [2021-01-07 04:29:42,138 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:29:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:29:42,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:29:42,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:29:42,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:29:42,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970265160] [2021-01-07 04:29:42,639 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:29:42,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339590111] [2021-01-07 04:29:42,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:29:42,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:29:42,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396075203] [2021-01-07 04:29:42,641 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:29:42,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:29:42,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:29:42,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:29:42,642 INFO L87 Difference]: Start difference. First operand 467 states and 610 transitions. Second operand 3 states. [2021-01-07 04:29:42,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:29:42,759 INFO L93 Difference]: Finished difference Result 951 states and 1247 transitions. [2021-01-07 04:29:42,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:29:42,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2021-01-07 04:29:42,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:29:42,762 INFO L225 Difference]: With dead ends: 951 [2021-01-07 04:29:42,763 INFO L226 Difference]: Without dead ends: 488 [2021-01-07 04:29:42,765 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:29:42,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2021-01-07 04:29:42,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 487. [2021-01-07 04:29:42,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2021-01-07 04:29:42,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 630 transitions. [2021-01-07 04:29:42,787 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 630 transitions. Word has length 97 [2021-01-07 04:29:42,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:29:42,788 INFO L481 AbstractCegarLoop]: Abstraction has 487 states and 630 transitions. [2021-01-07 04:29:42,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:29:42,788 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 630 transitions. [2021-01-07 04:29:42,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-01-07 04:29:42,790 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:29:42,790 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:29:43,003 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-01-07 04:29:43,004 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:29:43,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:29:43,006 INFO L82 PathProgramCache]: Analyzing trace with hash 948433376, now seen corresponding path program 1 times [2021-01-07 04:29:43,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:29:43,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439274816] [2021-01-07 04:29:43,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:29:43,032 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:29:43,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [248075200] [2021-01-07 04:29:43,032 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:29:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:29:43,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:29:43,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:29:43,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 04:29:43,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439274816] [2021-01-07 04:29:43,560 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:29:43,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248075200] [2021-01-07 04:29:43,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:29:43,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:29:43,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795706828] [2021-01-07 04:29:43,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:29:43,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:29:43,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:29:43,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:29:43,563 INFO L87 Difference]: Start difference. First operand 487 states and 630 transitions. Second operand 3 states. [2021-01-07 04:29:43,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:29:43,664 INFO L93 Difference]: Finished difference Result 787 states and 1024 transitions. [2021-01-07 04:29:43,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:29:43,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2021-01-07 04:29:43,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:29:43,668 INFO L225 Difference]: With dead ends: 787 [2021-01-07 04:29:43,668 INFO L226 Difference]: Without dead ends: 508 [2021-01-07 04:29:43,669 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:29:43,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-01-07 04:29:43,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 507. [2021-01-07 04:29:43,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2021-01-07 04:29:43,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 650 transitions. [2021-01-07 04:29:43,682 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 650 transitions. Word has length 97 [2021-01-07 04:29:43,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:29:43,683 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 650 transitions. [2021-01-07 04:29:43,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:29:43,683 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 650 transitions. [2021-01-07 04:29:43,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-01-07 04:29:43,685 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:29:43,685 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:29:43,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:29:43,900 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:29:43,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:29:43,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1352389214, now seen corresponding path program 1 times [2021-01-07 04:29:43,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:29:43,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471803702] [2021-01-07 04:29:43,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:29:43,928 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:29:43,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [654519899] [2021-01-07 04:29:43,929 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:29:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:29:44,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:29:44,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:29:44,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:29:44,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471803702] [2021-01-07 04:29:44,403 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:29:44,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654519899] [2021-01-07 04:29:44,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:29:44,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:29:44,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802551669] [2021-01-07 04:29:44,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:29:44,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:29:44,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:29:44,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:29:44,407 INFO L87 Difference]: Start difference. First operand 507 states and 650 transitions. Second operand 4 states. [2021-01-07 04:29:44,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:29:44,575 INFO L93 Difference]: Finished difference Result 1086 states and 1400 transitions. [2021-01-07 04:29:44,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:29:44,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2021-01-07 04:29:44,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:29:44,582 INFO L225 Difference]: With dead ends: 1086 [2021-01-07 04:29:44,582 INFO L226 Difference]: Without dead ends: 583 [2021-01-07 04:29:44,584 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:29:44,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2021-01-07 04:29:44,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 493. [2021-01-07 04:29:44,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2021-01-07 04:29:44,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 629 transitions. [2021-01-07 04:29:44,601 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 629 transitions. Word has length 97 [2021-01-07 04:29:44,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:29:44,602 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 629 transitions. [2021-01-07 04:29:44,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:29:44,602 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 629 transitions. [2021-01-07 04:29:44,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-01-07 04:29:44,610 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:29:44,610 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:29:44,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:29:44,821 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:29:44,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:29:44,822 INFO L82 PathProgramCache]: Analyzing trace with hash 881478960, now seen corresponding path program 1 times [2021-01-07 04:29:44,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:29:44,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592674049] [2021-01-07 04:29:44,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:29:44,875 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:29:44,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1237281040] [2021-01-07 04:29:44,876 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:29:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:29:45,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:29:45,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:29:45,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 04:29:45,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592674049] [2021-01-07 04:29:45,389 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:29:45,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237281040] [2021-01-07 04:29:45,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:29:45,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:29:45,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652023162] [2021-01-07 04:29:45,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:29:45,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:29:45,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:29:45,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:29:45,392 INFO L87 Difference]: Start difference. First operand 493 states and 629 transitions. Second operand 4 states. [2021-01-07 04:29:45,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:29:45,508 INFO L93 Difference]: Finished difference Result 761 states and 972 transitions. [2021-01-07 04:29:45,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:29:45,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2021-01-07 04:29:45,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:29:45,513 INFO L225 Difference]: With dead ends: 761 [2021-01-07 04:29:45,513 INFO L226 Difference]: Without dead ends: 480 [2021-01-07 04:29:45,514 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:29:45,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2021-01-07 04:29:45,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 479. [2021-01-07 04:29:45,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2021-01-07 04:29:45,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 608 transitions. [2021-01-07 04:29:45,530 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 608 transitions. Word has length 97 [2021-01-07 04:29:45,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:29:45,531 INFO L481 AbstractCegarLoop]: Abstraction has 479 states and 608 transitions. [2021-01-07 04:29:45,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:29:45,531 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 608 transitions. [2021-01-07 04:29:45,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-01-07 04:29:45,533 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:29:45,533 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:29:45,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:29:45,748 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:29:45,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:29:45,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1427704734, now seen corresponding path program 1 times [2021-01-07 04:29:45,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:29:45,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466886857] [2021-01-07 04:29:45,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:29:45,777 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:29:45,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [874267411] [2021-01-07 04:29:45,778 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:29:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:29:46,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 04:29:46,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:29:46,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:29:46,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466886857] [2021-01-07 04:29:46,205 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:29:46,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874267411] [2021-01-07 04:29:46,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:29:46,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:29:46,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996506882] [2021-01-07 04:29:46,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:29:46,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:29:46,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:29:46,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:29:46,208 INFO L87 Difference]: Start difference. First operand 479 states and 608 transitions. Second operand 3 states. [2021-01-07 04:29:46,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:29:46,324 INFO L93 Difference]: Finished difference Result 1231 states and 1562 transitions. [2021-01-07 04:29:46,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:29:46,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2021-01-07 04:29:46,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:29:46,329 INFO L225 Difference]: With dead ends: 1231 [2021-01-07 04:29:46,329 INFO L226 Difference]: Without dead ends: 756 [2021-01-07 04:29:46,330 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:29:46,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2021-01-07 04:29:46,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 721. [2021-01-07 04:29:46,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2021-01-07 04:29:46,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 930 transitions. [2021-01-07 04:29:46,354 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 930 transitions. Word has length 97 [2021-01-07 04:29:46,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:29:46,355 INFO L481 AbstractCegarLoop]: Abstraction has 721 states and 930 transitions. [2021-01-07 04:29:46,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:29:46,355 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 930 transitions. [2021-01-07 04:29:46,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-01-07 04:29:46,357 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:29:46,357 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:29:46,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-01-07 04:29:46,572 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:29:46,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:29:46,574 INFO L82 PathProgramCache]: Analyzing trace with hash -371205377, now seen corresponding path program 1 times [2021-01-07 04:29:46,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:29:46,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599479677] [2021-01-07 04:29:46,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:29:46,595 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:29:46,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [375866052] [2021-01-07 04:29:46,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:29:46,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:29:46,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:29:46,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:29:47,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:29:47,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599479677] [2021-01-07 04:29:47,067 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:29:47,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375866052] [2021-01-07 04:29:47,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:29:47,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:29:47,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124150576] [2021-01-07 04:29:47,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:29:47,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:29:47,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:29:47,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:29:47,070 INFO L87 Difference]: Start difference. First operand 721 states and 930 transitions. Second operand 3 states. [2021-01-07 04:29:47,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:29:47,139 INFO L93 Difference]: Finished difference Result 1400 states and 1809 transitions. [2021-01-07 04:29:47,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:29:47,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2021-01-07 04:29:47,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:29:47,144 INFO L225 Difference]: With dead ends: 1400 [2021-01-07 04:29:47,144 INFO L226 Difference]: Without dead ends: 727 [2021-01-07 04:29:47,146 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:29:47,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2021-01-07 04:29:47,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2021-01-07 04:29:47,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2021-01-07 04:29:47,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 936 transitions. [2021-01-07 04:29:47,171 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 936 transitions. Word has length 104 [2021-01-07 04:29:47,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:29:47,171 INFO L481 AbstractCegarLoop]: Abstraction has 727 states and 936 transitions. [2021-01-07 04:29:47,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:29:47,172 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 936 transitions. [2021-01-07 04:29:47,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-07 04:29:47,173 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:29:47,174 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:29:47,388 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:29:47,389 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:29:47,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:29:47,391 INFO L82 PathProgramCache]: Analyzing trace with hash -2085853600, now seen corresponding path program 1 times [2021-01-07 04:29:47,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:29:47,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406656936] [2021-01-07 04:29:47,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:29:47,413 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:29:47,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1326400455] [2021-01-07 04:29:47,414 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:29:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:29:47,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 04:29:47,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:29:47,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 04:29:47,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406656936] [2021-01-07 04:29:47,878 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:29:47,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326400455] [2021-01-07 04:29:47,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:29:47,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2021-01-07 04:29:47,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440931173] [2021-01-07 04:29:47,879 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:29:47,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:29:47,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:29:47,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:29:47,880 INFO L87 Difference]: Start difference. First operand 727 states and 936 transitions. Second operand 4 states. [2021-01-07 04:29:47,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:29:47,967 INFO L93 Difference]: Finished difference Result 1411 states and 1820 transitions. [2021-01-07 04:29:47,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:29:47,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2021-01-07 04:29:47,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:29:47,973 INFO L225 Difference]: With dead ends: 1411 [2021-01-07 04:29:47,973 INFO L226 Difference]: Without dead ends: 733 [2021-01-07 04:29:47,975 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:29:47,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2021-01-07 04:29:47,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2021-01-07 04:29:47,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2021-01-07 04:29:47,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 942 transitions. [2021-01-07 04:29:47,996 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 942 transitions. Word has length 106 [2021-01-07 04:29:47,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:29:47,997 INFO L481 AbstractCegarLoop]: Abstraction has 733 states and 942 transitions. [2021-01-07 04:29:47,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:29:47,997 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 942 transitions. [2021-01-07 04:29:47,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-01-07 04:29:47,999 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:29:47,999 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:29:48,212 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:29:48,213 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:29:48,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:29:48,214 INFO L82 PathProgramCache]: Analyzing trace with hash -462744993, now seen corresponding path program 2 times [2021-01-07 04:29:48,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:29:48,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143986790] [2021-01-07 04:29:48,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:29:48,233 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:29:48,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1363408981] [2021-01-07 04:29:48,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:29:48,718 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 04:29:48,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:29:48,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 04:29:48,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:29:48,903 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 04:29:48,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143986790] [2021-01-07 04:29:48,903 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:29:48,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363408981] [2021-01-07 04:29:48,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:29:48,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2021-01-07 04:29:48,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668254083] [2021-01-07 04:29:48,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 04:29:48,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:29:48,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 04:29:48,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:29:48,906 INFO L87 Difference]: Start difference. First operand 733 states and 942 transitions. Second operand 5 states. [2021-01-07 04:29:49,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:29:49,025 INFO L93 Difference]: Finished difference Result 1422 states and 1831 transitions. [2021-01-07 04:29:49,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 04:29:49,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2021-01-07 04:29:49,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:29:49,031 INFO L225 Difference]: With dead ends: 1422 [2021-01-07 04:29:49,031 INFO L226 Difference]: Without dead ends: 739 [2021-01-07 04:29:49,033 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:29:49,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2021-01-07 04:29:49,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2021-01-07 04:29:49,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2021-01-07 04:29:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 948 transitions. [2021-01-07 04:29:49,057 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 948 transitions. Word has length 108 [2021-01-07 04:29:49,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:29:49,058 INFO L481 AbstractCegarLoop]: Abstraction has 739 states and 948 transitions. [2021-01-07 04:29:49,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 04:29:49,058 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 948 transitions. [2021-01-07 04:29:49,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-01-07 04:29:49,060 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:29:49,061 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:29:49,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-07 04:29:49,276 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:29:49,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:29:49,277 INFO L82 PathProgramCache]: Analyzing trace with hash 87417216, now seen corresponding path program 3 times [2021-01-07 04:29:49,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:29:49,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924434948] [2021-01-07 04:29:49,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:29:49,294 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:29:49,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [197642302] [2021-01-07 04:29:49,295 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:29:49,662 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-01-07 04:29:49,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:29:49,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-07 04:29:49,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:29:49,728 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 04:29:49,729 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:29:49,736 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:29:49,737 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:29:49,737 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2021-01-07 04:29:49,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:29:49,837 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-01-07 04:29:49,841 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:29:49,846 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:29:49,848 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:29:49,849 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:71, output treesize:3 [2021-01-07 04:29:49,930 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 04:29:49,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924434948] [2021-01-07 04:29:49,931 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:29:49,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197642302] [2021-01-07 04:29:49,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:29:49,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 04:29:49,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713615100] [2021-01-07 04:29:49,932 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 04:29:49,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:29:49,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 04:29:49,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:29:49,933 INFO L87 Difference]: Start difference. First operand 739 states and 948 transitions. Second operand 5 states. [2021-01-07 04:29:51,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:29:51,125 INFO L93 Difference]: Finished difference Result 1382 states and 1772 transitions. [2021-01-07 04:29:51,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 04:29:51,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2021-01-07 04:29:51,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:29:51,130 INFO L225 Difference]: With dead ends: 1382 [2021-01-07 04:29:51,131 INFO L226 Difference]: Without dead ends: 739 [2021-01-07 04:29:51,133 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-07 04:29:51,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2021-01-07 04:29:51,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2021-01-07 04:29:51,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2021-01-07 04:29:51,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 947 transitions. [2021-01-07 04:29:51,158 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 947 transitions. Word has length 110 [2021-01-07 04:29:51,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:29:51,158 INFO L481 AbstractCegarLoop]: Abstraction has 739 states and 947 transitions. [2021-01-07 04:29:51,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 04:29:51,159 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 947 transitions. [2021-01-07 04:29:51,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-01-07 04:29:51,161 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:29:51,161 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:29:51,374 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:29:51,375 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:29:51,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:29:51,377 INFO L82 PathProgramCache]: Analyzing trace with hash -2117457625, now seen corresponding path program 1 times [2021-01-07 04:29:51,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:29:51,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199496807] [2021-01-07 04:29:51,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:29:51,397 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:29:51,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2026681648] [2021-01-07 04:29:51,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:29:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:29:51,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:29:51,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:29:51,982 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 04:29:51,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199496807] [2021-01-07 04:29:51,983 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:29:51,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026681648] [2021-01-07 04:29:51,983 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:29:51,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:29:51,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942023377] [2021-01-07 04:29:51,984 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:29:51,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:29:51,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:29:51,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:29:51,985 INFO L87 Difference]: Start difference. First operand 739 states and 947 transitions. Second operand 3 states. [2021-01-07 04:29:52,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:29:52,106 INFO L93 Difference]: Finished difference Result 1502 states and 1935 transitions. [2021-01-07 04:29:52,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:29:52,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2021-01-07 04:29:52,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:29:52,111 INFO L225 Difference]: With dead ends: 1502 [2021-01-07 04:29:52,111 INFO L226 Difference]: Without dead ends: 781 [2021-01-07 04:29:52,113 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:29:52,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2021-01-07 04:29:52,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 779. [2021-01-07 04:29:52,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2021-01-07 04:29:52,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 987 transitions. [2021-01-07 04:29:52,137 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 987 transitions. Word has length 157 [2021-01-07 04:29:52,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:29:52,138 INFO L481 AbstractCegarLoop]: Abstraction has 779 states and 987 transitions. [2021-01-07 04:29:52,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:29:52,138 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 987 transitions. [2021-01-07 04:29:52,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-01-07 04:29:52,140 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:29:52,141 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:29:52,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:29:52,355 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:29:52,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:29:52,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1572585051, now seen corresponding path program 1 times [2021-01-07 04:29:52,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:29:52,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870614703] [2021-01-07 04:29:52,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:29:52,376 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:29:52,376 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2120259913] [2021-01-07 04:29:52,376 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:29:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:29:52,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:29:52,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:29:52,947 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 04:29:52,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870614703] [2021-01-07 04:29:52,948 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:29:52,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120259913] [2021-01-07 04:29:52,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:29:52,949 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:29:52,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37858452] [2021-01-07 04:29:52,949 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:29:52,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:29:52,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:29:52,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:29:52,950 INFO L87 Difference]: Start difference. First operand 779 states and 987 transitions. Second operand 4 states. [2021-01-07 04:29:53,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:29:53,075 INFO L93 Difference]: Finished difference Result 1496 states and 1900 transitions. [2021-01-07 04:29:53,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:29:53,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2021-01-07 04:29:53,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:29:53,080 INFO L225 Difference]: With dead ends: 1496 [2021-01-07 04:29:53,080 INFO L226 Difference]: Without dead ends: 753 [2021-01-07 04:29:53,082 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:29:53,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2021-01-07 04:29:53,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 751. [2021-01-07 04:29:53,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2021-01-07 04:29:53,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 945 transitions. [2021-01-07 04:29:53,145 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 945 transitions. Word has length 157 [2021-01-07 04:29:53,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:29:53,145 INFO L481 AbstractCegarLoop]: Abstraction has 751 states and 945 transitions. [2021-01-07 04:29:53,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:29:53,145 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 945 transitions. [2021-01-07 04:29:53,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-01-07 04:29:53,148 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:29:53,148 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:29:53,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-01-07 04:29:53,363 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:29:53,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:29:53,364 INFO L82 PathProgramCache]: Analyzing trace with hash 94293941, now seen corresponding path program 1 times [2021-01-07 04:29:53,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:29:53,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011696576] [2021-01-07 04:29:53,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:29:53,386 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:29:53,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1321991387] [2021-01-07 04:29:53,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:29:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:29:53,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 04:29:53,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:29:54,010 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 04:29:54,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011696576] [2021-01-07 04:29:54,011 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:29:54,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321991387] [2021-01-07 04:29:54,011 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:29:54,011 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 04:29:54,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641722459] [2021-01-07 04:29:54,012 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 04:29:54,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:29:54,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 04:29:54,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:29:54,013 INFO L87 Difference]: Start difference. First operand 751 states and 945 transitions. Second operand 5 states. [2021-01-07 04:29:54,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:29:54,224 INFO L93 Difference]: Finished difference Result 2209 states and 2786 transitions. [2021-01-07 04:29:54,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 04:29:54,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2021-01-07 04:29:54,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:29:54,238 INFO L225 Difference]: With dead ends: 2209 [2021-01-07 04:29:54,238 INFO L226 Difference]: Without dead ends: 1496 [2021-01-07 04:29:54,245 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:29:54,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2021-01-07 04:29:54,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 797. [2021-01-07 04:29:54,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2021-01-07 04:29:54,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 995 transitions. [2021-01-07 04:29:54,276 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 995 transitions. Word has length 157 [2021-01-07 04:29:54,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:29:54,277 INFO L481 AbstractCegarLoop]: Abstraction has 797 states and 995 transitions. [2021-01-07 04:29:54,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 04:29:54,277 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 995 transitions. [2021-01-07 04:29:54,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-01-07 04:29:54,279 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:29:54,280 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:29:54,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-07 04:29:54,495 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:29:54,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:29:54,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1994860229, now seen corresponding path program 1 times [2021-01-07 04:29:54,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:29:54,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767932856] [2021-01-07 04:29:54,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:29:54,523 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:29:54,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1289253055] [2021-01-07 04:29:54,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:29:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:29:54,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 04:29:54,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:29:55,036 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 04:29:55,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767932856] [2021-01-07 04:29:55,037 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:29:55,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289253055] [2021-01-07 04:29:55,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:29:55,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:29:55,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975889449] [2021-01-07 04:29:55,038 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:29:55,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:29:55,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:29:55,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:29:55,039 INFO L87 Difference]: Start difference. First operand 797 states and 995 transitions. Second operand 4 states. [2021-01-07 04:29:55,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:29:55,126 INFO L93 Difference]: Finished difference Result 1503 states and 1887 transitions. [2021-01-07 04:29:55,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:29:55,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2021-01-07 04:29:55,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:29:55,131 INFO L225 Difference]: With dead ends: 1503 [2021-01-07 04:29:55,131 INFO L226 Difference]: Without dead ends: 733 [2021-01-07 04:29:55,133 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:29:55,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2021-01-07 04:29:55,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2021-01-07 04:29:55,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2021-01-07 04:29:55,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 917 transitions. [2021-01-07 04:29:55,163 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 917 transitions. Word has length 157 [2021-01-07 04:29:55,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:29:55,164 INFO L481 AbstractCegarLoop]: Abstraction has 733 states and 917 transitions. [2021-01-07 04:29:55,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:29:55,164 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 917 transitions. [2021-01-07 04:29:55,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-01-07 04:29:55,166 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:29:55,166 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:29:55,379 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-01-07 04:29:55,380 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:29:55,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:29:55,380 INFO L82 PathProgramCache]: Analyzing trace with hash 639166515, now seen corresponding path program 1 times [2021-01-07 04:29:55,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:29:55,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359075181] [2021-01-07 04:29:55,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:29:55,401 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:29:55,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1150677854] [2021-01-07 04:29:55,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:29:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:29:55,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-07 04:29:55,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:29:56,020 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-07 04:29:56,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359075181] [2021-01-07 04:29:56,020 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:29:56,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150677854] [2021-01-07 04:29:56,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:29:56,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2021-01-07 04:29:56,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389654671] [2021-01-07 04:29:56,021 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 04:29:56,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:29:56,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 04:29:56,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-07 04:29:56,022 INFO L87 Difference]: Start difference. First operand 733 states and 917 transitions. Second operand 6 states. [2021-01-07 04:29:56,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:29:56,140 INFO L93 Difference]: Finished difference Result 1424 states and 1796 transitions. [2021-01-07 04:29:56,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 04:29:56,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 157 [2021-01-07 04:29:56,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:29:56,146 INFO L225 Difference]: With dead ends: 1424 [2021-01-07 04:29:56,146 INFO L226 Difference]: Without dead ends: 739 [2021-01-07 04:29:56,148 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-07 04:29:56,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2021-01-07 04:29:56,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2021-01-07 04:29:56,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2021-01-07 04:29:56,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 923 transitions. [2021-01-07 04:29:56,175 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 923 transitions. Word has length 157 [2021-01-07 04:29:56,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:29:56,176 INFO L481 AbstractCegarLoop]: Abstraction has 739 states and 923 transitions. [2021-01-07 04:29:56,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 04:29:56,176 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 923 transitions. [2021-01-07 04:29:56,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-01-07 04:29:56,178 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:29:56,178 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:29:56,393 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:29:56,394 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:29:56,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:29:56,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1050888114, now seen corresponding path program 2 times [2021-01-07 04:29:56,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:29:56,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336912025] [2021-01-07 04:29:56,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:29:56,418 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:29:56,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1075612413] [2021-01-07 04:29:56,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:29:56,873 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 04:29:56,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:29:56,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-07 04:29:56,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:29:57,078 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-07 04:29:57,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336912025] [2021-01-07 04:29:57,079 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:29:57,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075612413] [2021-01-07 04:29:57,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:29:57,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-01-07 04:29:57,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870694730] [2021-01-07 04:29:57,080 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 04:29:57,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:29:57,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 04:29:57,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-07 04:29:57,081 INFO L87 Difference]: Start difference. First operand 739 states and 923 transitions. Second operand 7 states. [2021-01-07 04:29:57,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:29:57,206 INFO L93 Difference]: Finished difference Result 1435 states and 1807 transitions. [2021-01-07 04:29:57,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 04:29:57,207 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 159 [2021-01-07 04:29:57,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:29:57,211 INFO L225 Difference]: With dead ends: 1435 [2021-01-07 04:29:57,211 INFO L226 Difference]: Without dead ends: 745 [2021-01-07 04:29:57,214 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-07 04:29:57,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2021-01-07 04:29:57,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2021-01-07 04:29:57,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2021-01-07 04:29:57,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 929 transitions. [2021-01-07 04:29:57,243 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 929 transitions. Word has length 159 [2021-01-07 04:29:57,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:29:57,244 INFO L481 AbstractCegarLoop]: Abstraction has 745 states and 929 transitions. [2021-01-07 04:29:57,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 04:29:57,244 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 929 transitions. [2021-01-07 04:29:57,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-01-07 04:29:57,246 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:29:57,246 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:29:57,459 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-07 04:29:57,460 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:29:57,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:29:57,461 INFO L82 PathProgramCache]: Analyzing trace with hash 770488787, now seen corresponding path program 3 times [2021-01-07 04:29:57,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:29:57,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655385221] [2021-01-07 04:29:57,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:29:57,479 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:29:57,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [353618945] [2021-01-07 04:29:57,480 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:29:58,005 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-01-07 04:29:58,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:29:58,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 04:29:58,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:29:58,168 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-01-07 04:29:58,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655385221] [2021-01-07 04:29:58,168 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:29:58,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353618945] [2021-01-07 04:29:58,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:29:58,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:29:58,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400324545] [2021-01-07 04:29:58,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:29:58,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:29:58,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:29:58,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:29:58,170 INFO L87 Difference]: Start difference. First operand 745 states and 929 transitions. Second operand 3 states. [2021-01-07 04:29:58,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:29:58,271 INFO L93 Difference]: Finished difference Result 1749 states and 2217 transitions. [2021-01-07 04:29:58,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:29:58,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2021-01-07 04:29:58,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:29:58,277 INFO L225 Difference]: With dead ends: 1749 [2021-01-07 04:29:58,278 INFO L226 Difference]: Without dead ends: 1063 [2021-01-07 04:29:58,280 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:29:58,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2021-01-07 04:29:58,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 906. [2021-01-07 04:29:58,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2021-01-07 04:29:58,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1156 transitions. [2021-01-07 04:29:58,315 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1156 transitions. Word has length 161 [2021-01-07 04:29:58,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:29:58,315 INFO L481 AbstractCegarLoop]: Abstraction has 906 states and 1156 transitions. [2021-01-07 04:29:58,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:29:58,316 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1156 transitions. [2021-01-07 04:29:58,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-07 04:29:58,318 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:29:58,318 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:29:58,533 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-01-07 04:29:58,533 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:29:58,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:29:58,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1484056676, now seen corresponding path program 1 times [2021-01-07 04:29:58,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:29:58,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790827289] [2021-01-07 04:29:58,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:29:58,560 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:29:58,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [495670066] [2021-01-07 04:29:58,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:29:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:29:59,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-07 04:29:59,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:29:59,220 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-01-07 04:29:59,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790827289] [2021-01-07 04:29:59,221 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:29:59,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495670066] [2021-01-07 04:29:59,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:29:59,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2021-01-07 04:29:59,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586892678] [2021-01-07 04:29:59,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 04:29:59,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:29:59,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 04:29:59,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-01-07 04:29:59,223 INFO L87 Difference]: Start difference. First operand 906 states and 1156 transitions. Second operand 8 states. [2021-01-07 04:29:59,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:29:59,357 INFO L93 Difference]: Finished difference Result 1770 states and 2275 transitions. [2021-01-07 04:29:59,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 04:29:59,358 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 178 [2021-01-07 04:29:59,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:29:59,363 INFO L225 Difference]: With dead ends: 1770 [2021-01-07 04:29:59,363 INFO L226 Difference]: Without dead ends: 912 [2021-01-07 04:29:59,365 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-01-07 04:29:59,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2021-01-07 04:29:59,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 912. [2021-01-07 04:29:59,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 912 states. [2021-01-07 04:29:59,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1162 transitions. [2021-01-07 04:29:59,398 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1162 transitions. Word has length 178 [2021-01-07 04:29:59,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:29:59,399 INFO L481 AbstractCegarLoop]: Abstraction has 912 states and 1162 transitions. [2021-01-07 04:29:59,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 04:29:59,399 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1162 transitions. [2021-01-07 04:29:59,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2021-01-07 04:29:59,401 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:29:59,402 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:29:59,615 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:29:59,616 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:29:59,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:29:59,617 INFO L82 PathProgramCache]: Analyzing trace with hash -453644734, now seen corresponding path program 2 times [2021-01-07 04:29:59,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:29:59,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430672905] [2021-01-07 04:29:59,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:29:59,648 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:29:59,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [416560870] [2021-01-07 04:29:59,650 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:30:00,195 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 04:30:00,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:30:00,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 9 conjunts are in the unsatisfiable core [2021-01-07 04:30:00,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:30:00,427 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-01-07 04:30:00,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430672905] [2021-01-07 04:30:00,428 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:30:00,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416560870] [2021-01-07 04:30:00,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:30:00,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2021-01-07 04:30:00,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952929102] [2021-01-07 04:30:00,429 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 04:30:00,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:00,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 04:30:00,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-01-07 04:30:00,430 INFO L87 Difference]: Start difference. First operand 912 states and 1162 transitions. Second operand 9 states. [2021-01-07 04:30:00,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:00,588 INFO L93 Difference]: Finished difference Result 1781 states and 2286 transitions. [2021-01-07 04:30:00,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 04:30:00,589 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 182 [2021-01-07 04:30:00,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:00,594 INFO L225 Difference]: With dead ends: 1781 [2021-01-07 04:30:00,595 INFO L226 Difference]: Without dead ends: 918 [2021-01-07 04:30:00,597 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-01-07 04:30:00,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2021-01-07 04:30:00,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 918. [2021-01-07 04:30:00,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918 states. [2021-01-07 04:30:00,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1168 transitions. [2021-01-07 04:30:00,632 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1168 transitions. Word has length 182 [2021-01-07 04:30:00,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:00,633 INFO L481 AbstractCegarLoop]: Abstraction has 918 states and 1168 transitions. [2021-01-07 04:30:00,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 04:30:00,633 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1168 transitions. [2021-01-07 04:30:00,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-01-07 04:30:00,635 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:00,636 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:30:00,849 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:30:00,850 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:00,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:00,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1986963428, now seen corresponding path program 3 times [2021-01-07 04:30:00,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:00,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443532094] [2021-01-07 04:30:00,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:00,874 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:30:00,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [622080266] [2021-01-07 04:30:00,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:30:01,452 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-01-07 04:30:01,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:30:01,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 9 conjunts are in the unsatisfiable core [2021-01-07 04:30:01,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:30:01,842 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-01-07 04:30:01,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443532094] [2021-01-07 04:30:01,843 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:30:01,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622080266] [2021-01-07 04:30:01,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:30:01,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:30:01,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031809887] [2021-01-07 04:30:01,844 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:30:01,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:01,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:30:01,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:30:01,845 INFO L87 Difference]: Start difference. First operand 918 states and 1168 transitions. Second operand 4 states. [2021-01-07 04:30:02,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:02,570 INFO L93 Difference]: Finished difference Result 1509 states and 1921 transitions. [2021-01-07 04:30:02,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:30:02,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2021-01-07 04:30:02,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:02,577 INFO L225 Difference]: With dead ends: 1509 [2021-01-07 04:30:02,577 INFO L226 Difference]: Without dead ends: 732 [2021-01-07 04:30:02,579 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:30:02,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2021-01-07 04:30:02,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2021-01-07 04:30:02,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2021-01-07 04:30:02,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 909 transitions. [2021-01-07 04:30:02,618 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 909 transitions. Word has length 186 [2021-01-07 04:30:02,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:02,618 INFO L481 AbstractCegarLoop]: Abstraction has 732 states and 909 transitions. [2021-01-07 04:30:02,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:30:02,619 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 909 transitions. [2021-01-07 04:30:02,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2021-01-07 04:30:02,622 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:02,622 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:30:02,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:30:02,830 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:02,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:02,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1622468887, now seen corresponding path program 1 times [2021-01-07 04:30:02,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:02,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540177329] [2021-01-07 04:30:02,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:02,854 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:30:02,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1047290137] [2021-01-07 04:30:02,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:30:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:30:03,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 10 conjunts are in the unsatisfiable core [2021-01-07 04:30:03,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:30:03,631 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-01-07 04:30:03,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540177329] [2021-01-07 04:30:03,632 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:30:03,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047290137] [2021-01-07 04:30:03,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:30:03,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2021-01-07 04:30:03,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176130492] [2021-01-07 04:30:03,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 04:30:03,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:03,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 04:30:03,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-01-07 04:30:03,634 INFO L87 Difference]: Start difference. First operand 732 states and 909 transitions. Second operand 10 states. [2021-01-07 04:30:03,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:03,809 INFO L93 Difference]: Finished difference Result 1418 states and 1775 transitions. [2021-01-07 04:30:03,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 04:30:03,810 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 193 [2021-01-07 04:30:03,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:03,814 INFO L225 Difference]: With dead ends: 1418 [2021-01-07 04:30:03,814 INFO L226 Difference]: Without dead ends: 736 [2021-01-07 04:30:03,816 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-01-07 04:30:03,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2021-01-07 04:30:03,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 736. [2021-01-07 04:30:03,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2021-01-07 04:30:03,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 913 transitions. [2021-01-07 04:30:03,852 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 913 transitions. Word has length 193 [2021-01-07 04:30:03,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:03,853 INFO L481 AbstractCegarLoop]: Abstraction has 736 states and 913 transitions. [2021-01-07 04:30:03,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 04:30:03,853 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 913 transitions. [2021-01-07 04:30:03,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-01-07 04:30:03,854 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:03,855 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:30:04,068 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-01-07 04:30:04,069 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:04,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:04,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1336921525, now seen corresponding path program 2 times [2021-01-07 04:30:04,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:04,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203740894] [2021-01-07 04:30:04,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:04,089 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:30:04,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [608254231] [2021-01-07 04:30:04,089 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:30:04,680 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 04:30:04,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:30:04,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 11 conjunts are in the unsatisfiable core [2021-01-07 04:30:04,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:30:05,019 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2021-01-07 04:30:05,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203740894] [2021-01-07 04:30:05,019 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:30:05,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608254231] [2021-01-07 04:30:05,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:30:05,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2021-01-07 04:30:05,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635859101] [2021-01-07 04:30:05,020 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-07 04:30:05,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:05,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-07 04:30:05,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-01-07 04:30:05,021 INFO L87 Difference]: Start difference. First operand 736 states and 913 transitions. Second operand 11 states. [2021-01-07 04:30:05,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:05,220 INFO L93 Difference]: Finished difference Result 1425 states and 1782 transitions. [2021-01-07 04:30:05,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 04:30:05,221 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 197 [2021-01-07 04:30:05,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:05,226 INFO L225 Difference]: With dead ends: 1425 [2021-01-07 04:30:05,226 INFO L226 Difference]: Without dead ends: 740 [2021-01-07 04:30:05,228 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-01-07 04:30:05,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2021-01-07 04:30:05,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2021-01-07 04:30:05,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2021-01-07 04:30:05,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 917 transitions. [2021-01-07 04:30:05,266 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 917 transitions. Word has length 197 [2021-01-07 04:30:05,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:05,266 INFO L481 AbstractCegarLoop]: Abstraction has 740 states and 917 transitions. [2021-01-07 04:30:05,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-07 04:30:05,267 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 917 transitions. [2021-01-07 04:30:05,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2021-01-07 04:30:05,268 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:05,269 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:30:05,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-01-07 04:30:05,485 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:05,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:05,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1628837737, now seen corresponding path program 3 times [2021-01-07 04:30:05,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:05,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619334831] [2021-01-07 04:30:05,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:05,509 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:30:05,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1310921055] [2021-01-07 04:30:05,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true